The following pages link to (Q3922646):
Displaying 50 items.
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages (Q280200) (← links)
- Graph easy sets of mute lambda terms (Q288793) (← links)
- Preface to the special volume (Q534064) (← links)
- Uniqueness of Scott's reflexive domain in \(P\omega \) (Q672137) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- A characterization of lambda definability in categorical models of implicit polymorphism (Q673121) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- Extraction of redundancy-free programs from constructive natural deduction proofs (Q808284) (← links)
- Weak typed Böhm theorem on IMLL (Q866556) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Towards the range property for the lambda theory \(\mathcal H\) (Q930864) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- A typed lambda calculus with intersection types (Q930870) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- Strong normalization property for second order linear logic (Q1044837) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- Complexity of the combinator reduction machine (Q1075052) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Termination of rewriting (Q1098624) (← links)
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus (Q1104313) (← links)
- The calculus of constructions (Q1108266) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Generalization from partial parametrization in higher-order type theory (Q1122980) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) (Q1127535) (← links)
- Type checking with universes (Q1177937) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- From constructivism to computer science (Q1274450) (← links)
- Termination of permutative conversions in intuitionistic Gentzen calculi (Q1275632) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Some examples of non-existent combinators (Q1314364) (← links)
- Proofs as processes (Q1342245) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Label-selective \(\lambda\)-calculus syntax and confluence (Q1350342) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus (Q1356979) (← links)
