A categorical interpretation of Landin's correspondence principle

DOI10.1007/3-540-58027-1_29OpenAlexW1495707300MaRDI QIDQ5890068

David A. Schmidt, Anindya Banerjee

Publication date: 28 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58027-1_29

zbMATH Keywords

correspondence principleprogramming languagecomputation rulearithmetic expressionparameter binding

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Lambda-dropping: Transforming recursive equations into programs with block structure

Uses Software

• Forsythe

Cites Work

• Inferring the equivalence of functional programs that mutate data
• The revised report on the syntactic theories of sequential control and state
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Language design methods based on semantic principles
• Equivalence in functional languages with effects
• Correspondence between ALGOL 60 and Church's Lambda-notation
• The next 700 programming languages
• GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A categorical interpretation of Landin's correspondence principle