Pages that link to "Item:Q1155602"
From MaRDI portal
The following pages link to The lambda calculus, its syntax and semantics (Q1155602):
Displaying 50 items.
- Partial evaluation and \(\omega\)-completeness of algebraic specifications (Q1084849) (← links)
- Universal profinite domains (Q1093371) (← links)
- Implication and analysis in classical Frege structures (Q1095139) (← links)
- Functional programming with combinators (Q1098628) (← links)
- Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- A syntactic theory of sequential control (Q1101435) (← links)
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus (Q1104313) (← links)
- The calculus of constructions (Q1108266) (← links)
- Strictness analysis of the untyped \(\lambda\)-calculus (Q1114667) (← links)
- The word problem for Smullyan's lark combinator is decidable (Q1114668) (← links)
- E-ccc: Between ccc and topos (Q1117018) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- Concurrent transition systems (Q1119395) (← links)
- A type-free system extending (ZFC) (Q1121865) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Invertible terms in the lambda calculus (Q1145689) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Frame-fuzzy points and membership (Q1177690) (← links)
- Type checking with universes (Q1177937) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- The chemical abstract machine (Q1190491) (← links)
- An intuitionistic theory of types with assumptions of high-arity variables (Q1192333) (← links)
- Map theory (Q1193653) (← links)
- Lambek calculus with restricted contraction and expansion (Q1194112) (← links)
- The revised report on the syntactic theories of sequential control and state (Q1199538) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Normal forms have partial types (Q1209305) (← links)
- Denotational semantics of an object-oriented programming language with explicit wrappers (Q1261310) (← links)
- Abstraction problems in combinatory logic: A compositive approach (Q1262300) (← links)
- A syntactic theory of sequential state (Q1263961) (← links)
- The development of a partial evaluator for extended lambda calculus (Q1264617) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Some new results on easy lambda-terms (Q1314346) (← links)
- An analysis of Böhm's theorem (Q1314351) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Third order matching is decidable (Q1337691) (← links)
- \(\lambda_{\beta'}\) -- a \(\lambda\)-calculus with a generalized \(\beta\)-reduction rule (Q1349744) (← links)
- Constructive domain theory as a branch of intuitionistic pointfree topology (Q1350507) (← links)
- Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
- The application of automated reasoning to questions in mathematics and logic (Q1354049) (← links)
- Interaction and program generators. (Q1359341) (← links)
