The following pages link to The \(\lambda\)-context calculus (Q2871868):
Displaying 38 items.
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738) (← links)
- The calculus of context relations (Q918720) (← links)
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms (Q964000) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- A notation for lambda terms. A generalization of environments (Q1129257) (← links)
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 (Q1350516) (← links)
- The polarized \(\lambda\)-calculus (Q1744450) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus. (Q1853149) (← links)
- The differential lambda-calculus (Q1884894) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- Formal metatheory of the lambda calculus using Stoughton's substitution (Q2358702) (← links)
- Functional back-ends within the lambda-sigma calculus (Q2817681) (← links)
- Enriching the lambda calculus with contexts: toward a theory of incremental program construction (Q2817703) (← links)
- A meta lambda calculus with cross-level computation (Q2819825) (← links)
- Developing (meta)theory of \(\lambda\)-calculus in the theory of contexts (Q2841233) (← links)
- Sub-\(\lambda\)-calculi, classified (Q2870319) (← links)
- Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings (Q2958387) (← links)
- Context Update for Lambdas and Vectors (Q2964008) (← links)
- (Q3086783) (← links)
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations (Q3520145) (← links)
- The λ-calculus with constructors: Syntax, confluence and separation (Q3644936) (← links)
- One method of defining the semantics of programming language constructs in terms of lambda calculus. II (Q3706514) (← links)
- (Q3976042) (← links)
- The basis decision problem in λ‐calculus (Q4304128) (← links)
- (Q4304752) (← links)
- Thunks and the λ-calculus (Q4358459) (← links)
- (Q4806298) (← links)
- (Q4876428) (← links)
- (Q4912847) (← links)
- (Q4952053) (← links)
- Two-level Lambda-calculus (Q4982628) (← links)
- Programming in the λ-Calculus: From Church to Scott and Back (Q5410454) (← links)
- The Intensional Lambda Calculus (Q5434495) (← links)
- Logical Aspects of Computational Linguistics (Q5706932) (← links)
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (Q5747746) (← links)
- Foundations of Software Science and Computation Structures (Q5899101) (← links)