A syntactic theory of sequential state

DOI10.1016/0304-3975(89)90069-8zbMath0688.68014OpenAlexW2010525351MaRDI QIDQ1263961

Matthias Felleisen, Daniel P. Friedman

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90069-8

zbMATH Keywords

rewriting system\(\lambda \) -programming languageabstract machine semanticshigher-order programming language

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (6)

From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ iRho: an imperative rewriting calculus ⋮ The revised report on the syntactic theories of sequential control and state ⋮ Unnamed Item ⋮ An imperative pure calculus ⋮ Notions of computation and monads

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A syntactic theory of sequential control
• The lambda calculus, its syntax and semantics
• Circular expressions: elimination of static environments
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Scheme: A interpreter for extended lambda calculus
• A new implementation technique for applicative languages
• Correspondence between ALGOL 60 and Church's Lambda-notation
• The next 700 programming languages
• The Mechanical Evaluation of Expressions

This page was built for publication: A syntactic theory of sequential state