RSS Feed for term rewriting https://solvonauts.org/%3Faction%3Drss_search%26term%3Dterm+rewriting RSS Feed for term rewriting 6.844 Computability Theory of and with Scheme (MIT) 6.844 Computability Theory of and with Scheme (MIT) 6 844 is a graduate introduction to programming theory logic of programming and computability with the programming language Scheme used to crystallize computability constructions and as an object of study itself Topics covered include programming and computability theory based on a term rewriting substitution model of computation by Scheme programs with side effects computation as algebraic manipulation Scheme evaluation as algebraic manipulation and term rewriting theory paradoxes from self application and introduction to formal programming semantics undecidability of the Halting Problem for Scheme properties of recursively enumerable sets leading to Incompleteness Theorems for Scheme equivalences logic for program specification and verification and Hilbert s Tenth Prob 6 844 is a graduate introduction to programming theory logic of programming and computability with the programming language Scheme used to crystallize computability constructions and as an object of study itself Topics covered include programming and computability theory based on a term rewriting substitution model of computation by Scheme programs with side effects computation as algebraic manipulation Scheme evaluation as algebraic manipulation and term rewriting theory paradoxes from self application and introduction to formal programming semantics undecidability of the Halting Problem for Scheme properties of recursively enumerable sets leading to Incompleteness Theorems for Scheme equivalences logic for program specification and verification and Hilbert s Tenth Prob http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-844-computability-theory-of-and-with-scheme-spring-2003 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-844-computability-theory-of-and-with-scheme-spring-2003 6.827 Multithreaded Parallelism: Languages and Compilers (MIT) 6.827 Multithreaded Parallelism: Languages and Compilers (MIT) The topics covered in this course include Languages and compilers to exploit multithreaded parallelism Implicit parallel programming using functional languages and their extensions Higher order functions non strictness and polymorphism Explicit parallel programming and nondeterminism The lambda calculus and its variants Term rewriting and operational semantics Compiling multithreaded code for symmetric multiprocessors and clusters Static analysis and compiler optimizations This course is worth 4 Engineering Design Points The topics covered in this course include Languages and compilers to exploit multithreaded parallelism Implicit parallel programming using functional languages and their extensions Higher order functions non strictness and polymorphism Explicit parallel programming and nondeterminism The lambda calculus and its variants Term rewriting and operational semantics Compiling multithreaded code for symmetric multiprocessors and clusters Static analysis and compiler optimizations This course is worth 4 Engineering Design Points http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-827-multithreaded-parallelism-languages-and-compilers-fall-2002 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-827-multithreaded-parallelism-languages-and-compilers-fall-2002 6.844 Computability Theory of and with Scheme (MIT) 6 844 is a graduate introduction to programming theory logic of programming and computability with the programming language Scheme used to crystallize computability constructions and as an object of study itself Topics covered include programming and computability theory based on a term rewriting substitution model of computation by Scheme programs with side effects computation as algebraic manipulation Scheme evaluation as algebraic manipulation and term rewriting theory paradoxes from self application and introduction to formal programming semantics undecidability of the Halting Problem for Scheme properties of recursively enumerable sets leading to Incompleteness Theorems for Scheme equivalences logic for program specification and verification and Hilbert s Tenth Prob https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-844-computability-theory-of-and-with-scheme-spring-2003 https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-844-computability-theory-of-and-with-scheme-spring-2003 6.827 Multithreaded Parallelism: Languages and Compilers (MIT) The topics covered in this course include Languages and compilers to exploit multithreaded parallelism Implicit parallel programming using functional languages and their extensions Higher order functions non strictness and polymorphism Explicit parallel programming and nondeterminism The lambda calculus and its variants Term rewriting and operational semantics Compiling multithreaded code for symmetric multiprocessors and clusters Static analysis and compiler optimizations This course is worth 4 Engineering Design Points https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-827-multithreaded-parallelism-languages-and-compilers-fall-2002 https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-827-multithreaded-parallelism-languages-and-compilers-fall-2002