The following pages link to H. P. Barendregt (Q801049):
Displayed 50 items.
- Item:Q801049 (redirect page) (← links)
- Electronic communication of mathematics and the interaction of computer algebra systems and proof assistants (Q597106) (← links)
- The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050) (← links)
- Towards the range property for the lambda theory \(\mathcal H\) (Q930864) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- The lambda calculus, its syntax and semantics (Q1155602) (← links)
- A global representation of the recursive functions in the \(\lambda\)- calculus (Q1245931) (← links)
- Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus (Q1267843) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Autarkic computations in formal proofs (Q1610674) (← links)
- LEAN: An intermediate language based on graph rewriting (Q1823673) (← links)
- Enumerators of lambda terms are reducing constructively (Q1891248) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- (Q2751370) (← links)
- (Q2778865) (← links)
- (Q2878129) (← links)
- (Q3077958) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
- Loader and Urzyczyn Are Logically Related (Q3167026) (← links)
- (Q3221960) (← links)
- A filter lambda model and the completeness of type assignment (Q3335753) (← links)
- Recursion theoretic operators and morphisms on numbered sets (Q3340845) (← links)
- (Q3342534) (← links)
- Semantics for classical AUTOMATH and related systems (Q3678692) (← links)
- (Q3728878) (← links)
- (Q3731013) (← links)
- (Q3889024) (← links)
- (Q4038654) (← links)
- Combinatory logic and the ω-rule (Q4053616) (← links)
- Pairing Without Conventional Restraints (Q4053618) (← links)
- (Q4085718) (← links)
- (Q4100066) (← links)
- (Q4182476) (← links)
- Degrees of sensible lambda theories (Q4194931) (← links)
- Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic (Q4227871) (← links)
- (Q4263832) (← links)
- Systems of illative combinatory logic complete for first-order propositional and predicate calculus (Q4276020) (← links)
- The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
- Termination for direct sums of left-linear complete term rewriting systems (Q4369898) (← links)
- (Q4385533) (← links)
- (Q4397043) (← links)
- A characterization of terms of the <i>λI</i>-calculus having a normal form (Q4404859) (← links)
- (Q4428882) (← links)
- (Q4596793) (← links)
- (Q4619823) (← links)
- A two-level approach towards lean proof-checking (Q4647567) (← links)
- (Q4664918) (← links)
- (Q4721208) (← links)