Expressive power of typed and type-free programming languages
From MaRDI portal
Publication:761790
DOI10.1016/0304-3975(84)90088-4zbMath0557.68022MaRDI QIDQ761790
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90088-4
formal semantics; type theory; lambda-calculus; type-free programming concepts; typed lambda-schemes
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68N01: General topics in the theory of software
03B40: Combinatory logic and lambda calculus
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus, its syntax and semantics
- On procedures as open subroutines. II
- Theory of program structures: Schemes, semantics, verification
- Least fixed points revisited
- LCF considered as a programming language
- IO and OI. II
- A global representation of the recursive functions in the \(\lambda\)- calculus
- Fully abstract models of typed \(\lambda\)-calculi
- Simple program schemes and formal languages
- The programming language Pascal
- Combinatory logic. Vol. II
- The Standardization Theorem for λ‐Calculus
- Data Types as Lattices
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Initial Algebra Semantics and Continuous Algebras
- A draft description of Pascal
- Approximate Reduction and Lambda Calculus Models
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Algebraic automata and context-free sets
- On Classes of Program Schemata
- λ-definierbare Funktionen auf Peanoalgebren