Normalization, approximation, and semantics for combinator systems
From MaRDI portal
Publication:1853619
DOI10.1016/S0304-3975(02)00548-0zbMath1019.68059OpenAlexW2021916757MaRDI QIDQ1853619
Maribel Fernández, Steffen van Bakel
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00548-0
Related Items (5)
Semantic types and approximation for Featherweight Java ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming ⋮ Functional Type Assignment for Featherweight Java ⋮ Cut-elimination in the strict intersection type assignment system is strongly normalizing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatory logic. With two sections by William Craig.
- Principal type schemes for an extended type theory
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Full abstraction and limiting completeness in equational languages
- Sequentiality in orthogonal term rewriting systems
- Complete restrictions of the intersection type discipline
- Intersection types for combinatory logic
- Intersection type assignment systems
- Normalization results for typeable rewrite systems
- A filter lambda model and the completeness of type assignment
- Functional Characters of Solvable Terms
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Principal Type Schemes for the Strict Type Assignment System
- Approximation and normalization results for typeable term rewriting systems
- Functionality in Combinatory Logic
- Intensional interpretations of functionals of finite type I
This page was built for publication: Normalization, approximation, and semantics for combinator systems
