A theory for program and data type specification

DOI10.1016/0304-3975(92)90169-GzbMath0759.68061OpenAlexW2012140088MaRDI QIDQ1199933

Carolyn L. Talcott

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90169-g

zbMATH Keywords

reasoning about programsprogram equivalence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Program Synthesis Using Dual Interpretation ⋮ A first order logic of effects ⋮ Unnamed Item

Uses Software

• LISP
• ALGOL 60

Cites Work

• A syntactic theory of sequential control
• Partial abstract types
• The revised report on the syntactic theories of sequential control and state
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Scheme: A interpreter for extended lambda calculus
• On the algebraic definition of programming languages
• Stream Processing Functions
• Correspondence between ALGOL 60 and Church's Lambda-notation
• The next 700 programming languages
• Design of a separable transition-diagram compiler
• A simplifier for untyped lambda expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory for program and data type specification