Haskell on grzenow

Logic in Computer Science

Fri, 24 May 2024 00:00:00 +0000

This is a collection of projects completed for the Logic in Computer Science course, including:

Propositional logic in Haskell (Part 1):
- Satisfiable formulas, tautologies, disjunctive normal form (DNF), DNF-based SAT solver.
Propositional logic in Haskell (Part 2):
- Conjunctive normal form (CNF), equisatisfiable CNF (ENCF), Davis-Putnam SAT solver.
SAT solving with Z3 in Python (Part 1):
- Generating all satisfying assignments, pebbling formulas, n-queens problem.
SAT solving with Z3 in Python (Part 2):
- Shortest common superstring (SCS) problem, phase transitions for the k-SAT problem.
SMT solving with Z3 in Python:
- Łoś principle, function 91, Sudoku solver.
Intuitionistic propositional logic in Agda:
- Conjunction and disjunction proofs, de Morgan’s laws, weak Pierce’s law.
Intuitionistic first order logic in Agda:
- Universal and existential quantifier proofs, relations.

Latte Compiler

Sun, 21 Jan 2024 00:00:00 +0000

One of the major projects during my graduate studies was building a compiler for the Latte language, extended with features such as arrays, structs, and objects with single inheritance. The compiler parses Latte code using the BNFC tool and compiles it into x86 assembly.

The compiler’s core is implemented using a Reader-Writer-State monad:

data Reader = Rd
 { func :: Map.Map String TType
 , clss :: Map.Map String ClassEnv
 }
type Writer = [AsmInstr]
data State = St
 { nextlab :: Int
 , newloc :: Int
 , env :: Map.Map String (TType, String)
 , rodata :: Map.Map String String
 , rspOff :: Int
 }

where

Instant Compiler

Sat, 28 Oct 2023 00:00:00 +0000

Instant is a programming language that supports two types of statements:

expression - prints the value of the expression on stdout,
variable = expression - assigns the value of the expression to the variable.

Expressions can consist of integers, variables, and arithmetic operations between them.

The goal of this project was to create a compiler from Instant to JVM and LLVM architectures.

A detailed description can be found here.

Source code

Latte Interpreter

Wed, 10 May 2023 00:00:00 +0000

One of the larger projects I did during my undergraduate studies is undoubtedly an interpreter for the simple programming language Latte.

The interpreter is written in Haskell, and the grammar is parsed into this language using the BNFC tool. The implemented functionalities are described in detail on GitHub (link below), along with numerous examples, so below is a brief overview of the implementation details.

The code of the Latte language is automatically parsed by BNFC and then passed to static type checking. The monad representing the state of the TypeChecker looks as follows:

Sokoban

Thu, 08 Dec 2022 00:00:00 +0000

Sokoban is a puzzle game created as part of a functional programming course in Haskell.

The game was implemented in Haskell on the CodeWorld platform, where you can play it by clicking on this link.

Controls:

Space - start game
WSAD / Arrow keys - move forward
U - undo move
B - previous level
N - next level
R - reset level
Esc - reset game

Source code