adolfopa

#lang racket

(define (part-1)
  (with-input-from-file "input"
    (thunk
     (define input
       (for/list ([ln (in-lines)])
         (string->number ln)))
     (for/fold ([n 0] [p (first input)])
               ([x (in-list (rest input))])

adolfopa

: -range ( a-addr1 u -- a-addr2 a-addr1 )
  cells over + ;

: range ( a-addr1 u -- a-addr1 a-addr2)
  -range swap ;

: map! ( xt a-addr u -- )
  range ?do i @ over execute i ! cell +loop ;

: foldl ( xt w1 a-addr u2 -- w2 )

adolfopa

module Main where

import Database.HDBC
import Database.HDBC.Sqlite3
import Control.Exception

data Ctx = Ctx Connection

type DBResult = Either String ()

adolfopa

-- CIS 194: Homework 3 (http://www.cis.upenn.edu/~cis194/hw/03-ADTs.pdf)

module HW03 where

data Expression =
    Var String
  | Val Int
  | Op Expression Bop Expression
  deriving (Show, Eq)

adolfopa

-- CIS 194: Homework 2 (http://www.cis.upenn.edu/~cis194/hw/02-lists.pdf)

{-# OPTIONS_GHC -Wall #-}

module HW02 where
    
-- Supporting code

data Peg = Red | Green | Blue | Yellow | Orange | Purple
         deriving (Show, Eq, Ord)

adolfopa

-- CIS 194: Homework 1 (http://www.cis.upenn.edu/~cis194/hw/01-intro.pdf)

-- Exercise 1

lastDigit :: Integer -> Integer
lastDigit n = n `mod` 10

dropLastDigit :: Integer -> Integer
dropLastDigit n = n `div` 10

adolfopa

#lang racket/base

;;; Solution to
;;; http://programmingpraxis.com/2014/04/15/assembler-part-1
;;;
;;; adolfo.pa@gmail.com

(require racket/dict
         racket/match
         racket/sequence

adolfopa

/*
 * C solution to http://programmingpraxis.com/2011/08/16/insert-into-a-cyclic-sorted-list/
 */

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>

struct node {
     int value;

adolfopa

#lang racket

(require rackunit)

(define dictionary
  (set "a" "brown" "apple" "pie"))

(define (in-prefixes str)
  (define (pos->element i)
    (values (substring str 0 (+ 1 i)) (substring str (+ 1 i))))