The following pages link to (Q4722037):
Displaying 50 items.
- The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
- Experimenting with Isabelle in ZF set theory (Q1312157) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)
- Eta-conversion for the languages of explicit substitutions (Q1335136) (← links)
- Third order matching is decidable (Q1337691) (← links)
- Hierarchical addressing in symbolic computation (Q1339811) (← links)
- Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends (Q1346635) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- \(\lambda_{\beta'}\) -- a \(\lambda\)-calculus with a generalized \(\beta\)-reduction rule (Q1349744) (← links)
- Lambda terms definable as combinators (Q1349878) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- The ``relevance'' of intersection and union types (Q1381437) (← links)
- \(c\beta\)-Machine with \(\lambda \beta\)-reduction (Q1389686) (← links)
- Revisiting the notion of function (Q1394989) (← links)
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. (Q1401983) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- The semantics of entailment omega (Q1430899) (← links)
- Generalized filter models (Q1575259) (← links)
- A Gentzen-style sequent calculus of constructions with expansion rules (Q1575638) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Program development schemata as derived rules (Q1583853) (← links)
- Variables and scopes considered formally (Q1603432) (← links)
- Communication errors in the \(\pi\)-calculus are undecidable (Q1606997) (← links)
- Some analytic features of algebraic data (Q1613427) (← links)
- A computable expression of closure to efficient causation (Q1617623) (← links)
- The Church-Rosser theorem and quantitative analysis of witnesses (Q1627965) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- The foundation of a generic theorem prover (Q1823013) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Efficient multi-variate abstraction using an array representation for combinators. (Q1853162) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Structuring metatheory on inductive definitions (Q1854368) (← links)
- Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
- Higher-order substitutions (Q1854398) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- Church-Rosser property of a simple reduction for full first-order classical natural deduction (Q1861541) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- Totality in applicative theories (Q1896484) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- NP-completeness of a combinator optimization problem (Q1903594) (← links)
- A reduction rule for Peirce formula (Q1919985) (← links)
- The self-reduction in lambda calculus (Q1978706) (← links)
- Eager functions as processes (Q2123050) (← links)
- Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
