The following pages link to Combinatory logic. Vol. II (Q2553958):
Displaying 50 items.
- Bridging Curry and Church's typing style (Q334149) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- How to assign ordinal numbers to combinatory terms with polymorphic types (Q453195) (← links)
- The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454) (← links)
- On graph rewriting, reduction, and evaluation in the presence of cycles (Q526460) (← links)
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction (Q654911) (← links)
- Spaces with combinators (Q688513) (← links)
- New consecution calculi for \(R^{t}_{\to}\) (Q691126) (← links)
- A direct proof of the confluence of combinatory strong reduction (Q732008) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Une nouvelle C\(\beta\)-réduction dans la logique combinatoire (Q762137) (← links)
- Types of I-free hereditary right maximal terms (Q812102) (← links)
- Directly reflective meta-programming (Q848742) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- Schönfinkel-type operators for classical logic (Q993497) (← links)
- A solution to Curry and Hindley's problem on combinatory strong reduction (Q1014284) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Coquand's calculus of constructions: A mathematical foundation for a proof development system (Q1201296) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- A fuzzy language. (Q1426245) (← links)
- Sequential evaluation strategies for parallel-or and related reduction systems (Q1825644) (← links)
- Semantics for dual and symmetric combinatory calculi (Q1826434) (← links)
- Curry's type-rules are complete with respect to the F-semantics too (Q1839243) (← links)
- Some results on numerical systems in \(\lambda\)-calculus (Q1903129) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- NP-completeness of a combinator optimization problem (Q1903594) (← links)
- Curry's formalism as structuralism (Q1942337) (← links)
- Barendregt's problem \#26 and combinatory strong reduction (Q2104281) (← links)
- Combinatory logic with polymorphic types (Q2144609) (← links)
- New proofs of important theorems of untyped extensional \(\lambda\) calculus (Q2263308) (← links)
- A modern elaboration of the ramified theory of types (Q2563450) (← links)
- Equivalences between pure type systems and systems of illative combinatory logic (Q2565990) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- Compact numeral representation with combinators (Q3028973) (← links)
- A weak absolute consistency proof for some systems of illative combinatory logic (Q3043111) (← links)
- A combinatory account of internal structure (Q3173527) (← links)
- A new type assignment for λ-terms (Q3208623) (← links)
- On the interpretation of combinators with weak reduction (Q3320340) (← links)
- Category theory based on combinatory logic (Q3335754) (← links)
- A glimpse into the paradise of combinatory algebra (Q3343428) (← links)
- BUNDER’S PARADOX (Q3389494) (← links)
- On adding (<i>ξ</i>) to weak equality in combinatory logic (Q3480014) (← links)
- Principal type-schemes and condensed detachment (Q3489979) (← links)
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 (Q3616431) (← links)
- Meeting of the Association for Symbolic Logic Florence, Italy 1982 (Q3686697) (← links)
- Annual meeting of the Association for Symbolic Logic, Anaheim, 1985 (Q3720559) (← links)
