The following pages link to (Q5565113):
Displaying 50 items.
- Intersection types for combinatory logic (Q1199823) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- How to decide the lark (Q1208736) (← links)
- Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449) (← links)
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus (Q1229201) (← links)
- Quantifier-complete categories (Q1238805) (← links)
- Functionals computable in series and in parallel (Q1239155) (← links)
- Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus (Q1242896) (← links)
- A global representation of the recursive functions in the \(\lambda\)- calculus (Q1245931) (← links)
- A discrimination algorithm inside \(\lambda -\beta\)-calculus (Q1257009) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
- Abstraction problems in combinatory logic: A compositive approach (Q1262300) (← links)
- From constructivism to computer science (Q1274450) (← links)
- A finite equational axiomatization of the functional algebras for the lambda calculus (Q1283777) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Some examples of non-existent combinators (Q1314364) (← links)
- Combining type disciplines (Q1319505) (← links)
- The connection between an event structure semantics and an operational semantics for TCSP (Q1323346) (← links)
- Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends (Q1346635) (← links)
- Lambda terms definable as combinators (Q1349878) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Full abstraction and recursion (Q1365671) (← links)
- Developing developments (Q1392147) (← links)
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions (Q1400711) (← links)
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936) (← links)
- A binary modal logic for the intersection types of lambda-calculus. (Q1427854) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- On the representation of semigroups and other congruences in the lambda calculus (Q1744394) (← links)
- Projections for infinitary rewriting (Q1744449) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- A set of combinators for abstraction in linear space (Q1821553) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- Sequential evaluation strategies for parallel-or and related reduction systems (Q1825644) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Efficient multi-variate abstraction using an array representation for combinators. (Q1853162) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Variants of the basic calculus of constructions (Q1885480) (← links)
- On the \(\lambda Y\) calculus (Q1886326) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- The Girard-Reynolds isomorphism (Q1887154) (← links)
- On completeness and cocompleteness in and around small categories (Q1896485) (← links)
- On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
- From distributed coordination to field calculus and aggregate computing (Q2011213) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda (Q2229159) (← links)
