The following pages link to (Q4274979):
Displayed 28 items.
- Forcing in stable models of untyped \(\lambda\)-calculus (Q698623) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- A general storage theorem for integers in call-by-name \(\lambda\)- calculus (Q1329740) (← links)
- Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- A semantical storage operator theorem for all types (Q1382182) (← links)
- Computational isomorphisms in classical logic (Q1398471) (← links)
- System ST toward a type system for extraction and proofs of programs (Q1400600) (← 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)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Non-strictly positive fixed points for classical natural deduction (Q1772778) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Getting results from programs extracted from classical proofs (Q1882897) (← links)
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic (Q1884882) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- Fresh logic: Proof-theory and semantics for FM and nominal techniques (Q2372191) (← links)
- The graphical Krivine machine (Q2464713) (← links)
- A call-by-name lambda-calculus machine (Q2464723) (← links)
- A Relational Model of a Parallel and Non-deterministic λ-Calculus (Q3605523) (← links)
- On the Values of Reducibility Candidates (Q3637200) (← links)
- A \(\kappa\)-denotational semantics for map theory in ZFC+SI (Q5906925) (← links)
- An ordinal measure based procedure for termination of functions (Q5940917) (← links)
- Completeness, minimal logic and programs extraction (Q5940922) (← links)
- On the construction of stable models of untyped \(\lambda\)-calculus (Q5958611) (← links)