The following pages link to Hendrik Pieter Barendregt (Q801049):
Displayed 19 items.
- <i>Theoretical Pearls</i>Enumerators of lambda terms are reducing (Q4763984) (← links)
- Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> (Q4764617) (← links)
- (Q4865608) (← links)
- (Q4912847) (← links)
- Introduction to generalized type systems (Q4939697) (← links)
- Introduction to generalized type systems (Q4939699) (← links)
- Applications of Plotkin-terms: partitions and morphisms for closed terms (Q4943310) (← links)
- Lambda terms for natural deduction, sequent calculus and cut elimination (Q4948037) (← links)
- Termination for the direct sum of left-linear term rewriting systems (Q5055740) (← links)
- (Q5119396) (← links)
- (Q5181345) (← links)
- (Q5224680) (← links)
- Foundations of Mathematics from the Perspective of Computer Verification (Q5261836) (← links)
- The challenge of computer mathematics (Q5301849) (← links)
- Automata Theoretic Account of Proof Search (Q5351954) (← links)
- An Ontology of States (Q5410449) (← links)
- (Q5507097) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898150) (← links)
- Partial combinatory algebra and generalized numberings (Q6327371) (← links)