Algebraic types in PER models

DOI10.1007/BFb0040266OpenAlexW1514349410MaRDI QIDQ5887524

Edmund P. Robinson, J. M. E. Hyland, Giuseppe Rosolini

Publication date: 12 April 2023

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

Full work available at URL: https://doi.org/10.1007/bfb0040266

zbMATH Keywords

lambda calculusinitial algebrapolymorphic typealgebraic typeclosed term

Mathematics Subject Classification ID

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

Related Items (2)

Polynat in PER models ⋮ Linear realizability and full completeness for typed lambda-calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensional models for polymorphism
• A new type-checker for a functional language
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• The Expressiveness of Simple and Second-Order Type Structures
• Algorithmic operators in constructive metric spaces

This page was built for publication: Algebraic types in PER models