The following pages link to (Q3342534):
Displaying 50 items.
- On sets of solutions to combinator equations (Q582274) (← links)
- Higher-order subtyping and its decidability (Q598199) (← links)
- A note on preservation of strong normalisation in the \(\lambda \)-calculus (Q631760) (← links)
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- A note on inconsistencies caused by fixpoints in a cartesian closed category (Q749648) (← links)
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus (Q752684) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- Telescopic mappings in typed lambda calculus (Q757027) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL (Q918956) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- On the implementation of abstract data types by programming language constructs (Q1089793) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Every countable poset is embeddable in the poset of unsolvable terms (Q1098834) (← links)
- Combinatory weak reduction in lambda calculus (Q1129266) (← links)
- Recursion over realizability structures (Q1173956) (← links)
- Partial inductive definitions (Q1177153) (← links)
- Normal forms for a class of formulas (Q1186734) (← links)
- Constructive \(\lambda\)-models (Q1192622) (← links)
- Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Extension of combinatory logic to a theory of combinatory representation (Q1193865) (← links)
- On the adequacy of representing higher order intuitionistic logic as a pure type system (Q1194249) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
- An equivalence between lambda- terms (Q1322165) (← links)
- Classical logic, storage operators and second-order lambda-calculus (Q1326769) (← links)
- The Inf function in the system \(F\) (Q1346636) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- A unified approach to type theory through a refined \(\lambda\)-calculus (Q1349674) (← links)
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 1 (Q1350516) (← links)
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 2 (Q1350518) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- On the semantics of the call-by-name CPS transform (Q1575687) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus (Q1786610) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Games characterizing Levy-Longo trees (Q1884875) (← links)
- The differential lambda-calculus (Q1884894) (← links)
- Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
- Totality in applicative theories (Q1896484) (← links)
- On perfect ideals of seminearrings (Q2051353) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
