Pages that link to "Item:Q801050"
From MaRDI portal
The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):
Displayed 50 items.
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Continuous monoids and semirings (Q596031) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Comparing models of the intensional typed \(\lambda\)-calculus (Q671646) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Principles of programming with complex objects and collection types (Q672333) (← links)
- Properties of a first-order functional language with sharing (Q673126) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Spaces with combinators (Q688513) (← links)
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- Forcing in stable models of untyped \(\lambda\)-calculus (Q698623) (← links)
- Simulations in coalgebra (Q703522) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Retractions of dI-domains as a model for Type:Type (Q805221) (← links)
- Simple consequence relations (Q809992) (← links)
- A variadic extension of Curry's fixed-point combinator (Q812092) (← links)
- A calculus of coroutines (Q817847) (← links)
- Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738) (← links)
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- Type checking a multithreaded functional language with session types (Q859841) (← links)
- Weak typed Böhm theorem on IMLL (Q866556) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Fair ambients (Q877172) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- A logic of abstraction related to finite constructive number classes (Q910401) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation) (Q923069) (← links)
- The heart of intersection type assignment: Normalisation proofs revisited (Q930869) (← links)
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage (Q930871) (← links)
- An irregular filter model (Q930872) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Substitution revisited (Q1106190) (← links)
- Algebra of constructions. I. The word problem for partial algebras (Q1107515) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Lazy variable-renumbering makes substitution cheap (Q1114386) (← links)
- Equivalence of bar recursors in the theory of functionals of finite type (Q1115867) (← links)
- Unique normal forms for lambda calculus with surjective pairing (Q1117204) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Generalization from partial parametrization in higher-order type theory (Q1122980) (← links)