Homework Assignment 2 Due Wednesday, Feb 7th at 11:59PM (Pacific Time) In this assignment, you will augment the simple arithmetic language in the last assignment with lambda calculus. The resulting language is called . This language is so powerful that it can simulate the execution of any Turing machine, and thus any computer program in […]
Lab 3 – Implementing a Shell FAQ | Additional Notes | Grading Form P1 | Grading Form P2 | Final Grading Form Any changes that need to be made to the handout / lab will be mentioned here. Introduction Getting Started Part 1: Parsing and Executing Commands Part 1A: Lex and Yacc – Accepting more
CS252 Lab 3 Shell Handout Read More »
Homework Assignment 1 Due Wednesday, January 24, 2023 at 11:59pm (Pacific Time) Instructions 1. Clonethisdirectorytoyourlocalmachine. 2. Install OCaml following this guide. Report any issues you encounter in the #tech-support channel on 3. Run opam install . –deps-only in the root directory of this homework to install the necessary dependencies. 4. Complete part1.ml through part4.ml by
ECE463/563 – Microprocessor Architecture Project #1 Due date: February 15-20, 2024 – ECE463 students: submission deadline: February 15, 2024 – ECE563 students: o SubmissiondeadlineforECE463versionofthecode:February15,2024 o SubmissiondeadlineforECE563versionofthecode:February20,2024 The goal of this project is to design and implement a C/C++ cycle-accurate simulator of a 5-stage MIPS-like pipelined processor. Students taking the course at the undergraduate level (ECE463)
ECE463 ECE563 project1 Read More »
Assignment 3: PCF, FPC, and PyCF 15-312: Principles of Programming Languages (Fall 2023) In this assignment you will explore concepts of self-reference in programming languages. In PCF we consider self-reference at the term level. Most often students encounter this form of self-reference when defining recursive functions, those that “call themselves” when applied to an argument.
Assignment 2: Induction, Coinduction, and Recursion 15-312: Principles of Programming Languages (Fall 2023) In this assignment, we’ll explore generic programming with inductive and coinductive types, em- bedded in Standard ML. In functional programming lingo, this technique is often called “recursion schemes”.1 We will then consider how to formally prove code using inductive and coinductive types
Assignment 1: Statics and Dynamics, Safety, and Finite Data Types 15-312: Principles of Programming Languages (Fall 2023) On this assignment, you will implement the statics and dynamics of a simple programming language, PSF, which has product, sum, and function types. You will also prove that the language is safe, showing some cases of progress and
Assignment 5: Concurrency 15-312: Principles of Programming Languages (Spring 2023) This assignment studies concurrency through the lens of a concurrent programming language known as Concurrent Algol (CA). Effectful computations (involving side-effects) distinguish themselves from “pure” computation by involving some sort of interaction. Think IO effects (user interaction) or reference cells (state/mem- ory interaction). We seek
Assignment 0: Judgments, Rules, and Church’s λ-Calculus 15-312: Principles of Programming Languages (Fall 2023) Welcome to 15-312! In this assignment, we will explore foundational concepts in programming languages through the lens of Church’s λ-calculus. In this first assignment, we are introducing the use of inductive definitions of judgments about terms in the λ-calculus. The λ-calculus
Lab Exercises for COMP26020 Part 2: Functional Programming in Haskell Joe Razavi December 8, 2023 The deadline for this lab is 6pm on 16/2/2024. This lab has three exercises, for a total of ten marks. The first two exercises together are worth eight marks, and I advise all students to focus exclusively on these exercises.
COMP26020 Part 2: Functional Programming in Haskell Read More »