Pages that link to "Item:Q801050"

The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):

Displaying 50 items.

• Lambda-calculus with director strings (Q1778107) (← links)
• Comparing and implementing calculi of explicit substitutions with eta-reduction (Q1779307) (← links)
• Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
• A proof of the substitution lemma in de Bruijn's notation (Q1802059) (← links)
• Strong storage operators and data types (Q1805408) (← links)
• Building continuous webbed models for system F (Q1826624) (← links)
• Normalization without reducibility (Q1840460) (← links)
• The sequentially realizable functionals (Q1849853) (← links)
• Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
• An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus. (Q1853149) (← links)
• A cartesian closed category in Martin-Löf's intuitionistic type theory (Q1853587) (← links)
• A full continuous model of polymorphism (Q1853594) (← links)
• Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
• Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
• Bisimilarity of open terms. (Q1854331) (← links)
• Higher order unification via explicit substitutions (Q1854337) (← links)
• The combinator S (Q1854346) (← links)
• Descendants and origins in term rewriting. (Q1854348) (← links)
• Full abstraction for PCF (Q1854394) (← links)
• Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
• A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
• Dependent types with subtyping and late-bound overloading (Q1854436) (← links)
• Parallel beta reduction is not elementary recursive (Q1854460) (← links)
• A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser (Q1854476) (← links)
• Encoding linear logic with interaction combinators (Q1854547) (← links)
• Intersection and singleton type assignment characterizing finite Böhm-trees (Q1854555) (← links)
• Conservation and uniform normalization in lambda calculi with erasing reductions (Q1854562) (← links)
• On the expressiveness of choice quantification (Q1874242) (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
• Pattern matching as cut elimination (Q1882898) (← links)
• Nominal unification (Q1882909) (← links)
• A first-order one-pass CPS transformation (Q1884883) (← links)
• Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
• Order-incompleteness and finite lambda reduction models (Q1884896) (← links)
• Confluence of the coinductive \(\lambda\)-calculus (Q1884931) (← links)
• Limiting partial combinatory algebras (Q1884934) (← links)
• Intersection types for explicit substitutions (Q1887145) (← links)
• Nominal logic, a first order theory of names and binding (Q1887151) (← links)
• Infinite intersection types (Q1887155) (← links)
• Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
• OTTER experiments in a system of combinatory logic (Q1893130) (← links)
• Some results on numerical systems in \(\lambda\)-calculus (Q1903129) (← links)
• Normal forms in combinatory logic (Q1903133) (← links)
• Integration of parametric and ``ad hoc'' second order polymorphism in a calculus with subtyping (Q1918933) (← links)
• Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
• Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
• The self-reduction in lambda calculus (Q1978706) (← links)
• On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
• Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
• A formal system of reduction paths for parallel reduction (Q1989338) (← links)