The following pages link to (Q3522248):
Displaying 50 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Bridging Curry and Church's typing style (Q334149) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454) (← links)
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction (Q654911) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050) (← links)
- Reduction rules for intuitionistic \(\lambda\rho\)-calculus (Q897480) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- A solution to Curry and Hindley's problem on combinatory strong reduction (Q1014284) (← links)
- Lambda terms definable as combinators (Q1349878) (← links)
- The Church-Rosser theorem and quantitative analysis of witnesses (Q1627965) (← links)
- The broadest necessity (Q1633208) (← links)
- A formal system of reduction paths for parallel reduction (Q1989338) (← links)
- A simplified proof of the Church-Rosser theorem (Q2016071) (← links)
- A theory of necessities (Q2078981) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- A combinator-based superposition calculus for higher-order logic (Q2096452) (← links)
- Barendregt's problem \#26 and combinatory strong reduction (Q2104281) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- Strong reduction of combinatory calculus with streams (Q2352459) (← links)
- Structure by proxy, with an application to grounding (Q2695390) (← links)
- Towards a homotopy domain theory (Q2700838) (← links)
- Book review of: H. Barendregt et al., Lambda calculus with types (Q2922875) (← links)
- Typing Weak MSOL Properties (Q2949449) (← links)
- A proof-theoretic treatment of <i>λ</i>-reduction with cut-elimination: <i>λ</i>-calculus as a logic programming language (Q3011126) (← links)
- (Q3077958) (← links)
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables (Q3094165) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- Verificationism and Classical Realizability (Q3305313) (← links)
- Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey (Q3305634) (← links)
- BUNDER’S PARADOX (Q3389494) (← links)
- A Nominal Axiomatization of the Lambda Calculus (Q3553919) (← links)
- An Introduction to the Lambda Calculus (Q3599178) (← links)
- Unifying Math Ontologies: A Tale of Two Standards (Q3637283) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- The lambda calculus and adjoint functors (Q4428877) (← links)
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers (Q4603430) (← links)
- (Q4722037) (← links)
- (Q4890393) (← links)
- (Q4912847) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- (Q4991956) (← links)
- The Scott model of PCF in univalent type theory (Q5055497) (← links)
- The combinator M and the Mockingbird lattice (Q5059139) (← links)
- Normalization by Evaluation for Typed Weak lambda-Reduction (Q5091147) (← links)
- The Functional Interpretation of Direct Computations (Q5179008) (← links)
- Constructibility and Geometry (Q5213630) (← links)
- Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) (Q5277900) (← links)
