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.
- Regular expressions with nested levels of back referencing form a hierarchy (Q293228) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Cartesian closed categories of algebraic cpos (Q584381) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Uniqueness of Scott's reflexive domain in \(P\omega \) (Q672137) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- Lambda abstraction algebras: representation theorems (Q674002) (← links)
- Equational theories for inductive types (Q678762) (← links)
- A theory of binding structures and applications to rewriting (Q685380) (← links)
- On stable domains (Q685428) (← links)
- Conditional linearization (Q698633) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- Functorial polymorphism (Q753948) (← links)
- Reduction of higher type levels by means of an ordinal analysis of finite terms (Q759749) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Une nouvelle C\(\beta\)-réduction dans la logique combinatoire (Q762137) (← links)
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Learning problem for functional programming and model of biological evolution (Q779745) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- Reduction graphs in the lambda calculus (Q792994) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- On graph rewritings (Q800736) (← links)
- \(\lambda\)-definability of free algebras (Q803116) (← links)
- The absence and the presence of fixed point combinators (Q807612) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- Skeletons, bodies and generalized \(E(R)\)-algebras. (Q843187) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Meta-circular interpreter for a strongly typed language (Q908683) (← links)
- E-ccc: between ccc and topos, - its expressive power from the viewpoint of data type theory (Q908685) (← links)
- A typed calculus based on a fragment of linear logic (Q908909) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Constructive system for automatic program synthesis (Q912589) (← links)
- A characterization of lambda definable tree operations (Q918191) (← links)
- Fuzzy topology with respect to continuous lattices (Q919643) (← links)
- Nominal techniques in Isabelle/HOL (Q928672) (← links)
- Parametric \(\lambda \)-theories (Q930867) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Types as graphs: Continuations in type logical grammar (Q1006443) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Complexity of the combinator reduction machine (Q1075052) (← links)
- Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus (Q1075312) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
