Normalization, approximation, and semantics for combinator systems
From MaRDI portal
Recommendations
- Approximation and normalization results for typeable term rewriting systems
- The heart of intersection type assignment: Normalisation proofs revisited
- A filter lambda model and the completeness of type assignment
- (Head-)normalization of typeable rewrite systems
- A Filter Model for Concurrent $\lambda$-Calculus
Cites work
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1142322 (Why is no real title available?)
- A filter lambda model and the completeness of type assignment
- Approximation and normalization results for typeable term rewriting systems
- Combinatory logic. With two sections by William Craig.
- Complete restrictions of the intersection type discipline
- Full abstraction and limiting completeness in equational languages
- Functional Characters of Solvable Terms
- Functionality in Combinatory Logic
- Intensional interpretations of functionals of finite type I
- Intersection type assignment systems
- Intersection types for combinatory logic
- Normalization results for typeable rewrite systems
- Principal Type Schemes for the Strict Type Assignment System
- Principal type schemes for an extended type theory
- Sequentiality in orthogonal term rewriting systems
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(8)- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- 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 (extended abstract)
- Functional type assignment for Featherweight Java. To Rinus Plasmeijer, in honour of his 61st birthday
- scientific article; zbMATH DE number 598799 (Why is no real title available?)
- Approximation and normalization results for typeable term rewriting systems
- Explicit Composition and Its Application in Proofs of Normalization
- Semantic types and approximation for Featherweight Java
This page was built for publication: Normalization, approximation, and semantics for combinator systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853619)
