编译器课程的内容包括：
// ************************ // ******* Decoders ******* // ************************ #let dec_bool = lambda b. (b true) false #let dec_nat = lambda n. (n 0) (lambda _. lambda r. r + 1) #let dec_list = lambda xs. (xs Nil) (lambda x. lambda _. lambda r. x :: r) #let dec_tree = lambda t. t Nil (lambda x,_,_,l,r. […]
Homework Assignment 4 Due Friday, March 1st, 11:59PM (pacific time) In this assignment, you will use OCaml to implement the type system of ¦Ë+. Instructions 0. Makesureyoudownloadthelatestversionofthereferencemanualusingthislink.Youwillneedto refer to the chapter on type checking in the language reference manual. 1. Eitherclonethisdirectory,ordownloadthezippeddirectoryusingthislink. 2. Thefilesrequiredforthisassignmentarelocatedinthisfolder.Inparticular,youwillneedto implement the abstract_eval function in lib/lamp/typecheck.ml. 3. Youmustnotchangethetypesignaturesoftheoriginalfunctions.Otherwise,yourprogramwillnot compile. If you accidentally
Homework Assignment 3 Due Tuesday, Feb 20th at 11:59PM (Pacific Time) In this assignment, we will continue to augment . This time, we will add booleans, lists, and recursion. This homework will consist of four parts. The first part gives you lots of practice with the syntax and the operational semantics of the augmented language.
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
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 4: Effects: Control and Storage 15-312: Principles of Programming Languages (Fall 2023) This assignment will familiarize you with effects that are widely present in programming language. Effects, or side effects are umbrella terms used to describe any computational phenomenon that is not fully captured in the return value of an expression. Common examples of
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