Searching for term rewriting : 4 results found | RSS Feed for this search

Description

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 ProbSubjects

Scheme | Scheme | programming theory | programming theory | logic of programming | logic of programming | computability | computability | programming language | programming language | Scheme evaluation | Scheme evaluation | algebraic manipulation | algebraic manipulation | term rewriting theory | term rewriting theory | programming semantics | programming semantics | Halting Problem for Scheme | Halting Problem for Scheme | Incompleteness Theorems | Incompleteness Theorems | Hilbert's Tenth Problem | Hilbert's Tenth ProblemLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

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.Subjects

languages | languages | compilers | compilers | multithreaded parallelism | multithreaded parallelism | implicit parallel programming | implicit parallel programming | higher order functions | higher order functions | non-strictness | non-strictness | polymorphism | polymorphism | explicit parallel programming | explicit parallel programming | nondeterminism | nondeterminism | lambda calculus | lambda calculus | term rewriting | term rewriting | symmetric multiprocessors | symmetric multiprocessors | clusters | clusters | static analysis | static analysis | compiler optimizations | compiler optimizationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.844 Computability Theory of and with Scheme (MIT)

Description

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 ProbSubjects

Scheme | programming theory | logic of programming | computability | programming language | Scheme evaluation | algebraic manipulation | term rewriting theory | programming semantics | Halting Problem for Scheme | Incompleteness Theorems | Hilbert's Tenth ProblemLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.827 Multithreaded Parallelism: Languages and Compilers (MIT)

Description

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.Subjects

languages | compilers | multithreaded parallelism | implicit parallel programming | higher order functions | non-strictness | polymorphism | explicit parallel programming | nondeterminism | lambda calculus | term rewriting | symmetric multiprocessors | clusters | static analysis | compiler optimizationsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata