Pages that link to "Item:Q801050"
From MaRDI portal
The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):
Displaying 50 items.
- A core model for choreographic programming (Q2007727) (← links)
- Evaluating lambda terms with traversals (Q2007730) (← links)
- A simplified proof of the Church-Rosser theorem (Q2016071) (← links)
- On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
- The bang calculus revisited (Q2039931) (← links)
- A thesis for interaction (Q2055962) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- Rensets and renaming-based recursion for syntax with bindings (Q2104549) (← links)
- Eager functions as processes (Q2123050) (← links)
- Proving soundness of extensional normal-form bisimilarities (Q2130582) (← links)
- Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Functions-as-constructors higher-order unification: extended pattern unification (Q2134936) (← links)
- Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus (Q2141293) (← links)
- Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- Spinal atomic \(\lambda\)-calculus (Q2200851) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Whither semantics? (Q2286732) (← links)
- Automorphisms of types and their applications (Q2307975) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Linear numeral systems (Q2331071) (← links)
- (In)efficiency and reasonable cost models (Q2333310) (← links)
- Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (Q2333314) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments (Q2350605) (← links)
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars (Q2355681) (← links)
- Formal metatheory of the lambda calculus using Stoughton's substitution (Q2358702) (← links)
- Easiness in graph models (Q2368937) (← links)
- Intersection types and lambda models (Q2369008) (← links)
- Nominal rewriting (Q2373703) (← links)
- A general mathematics of names (Q2373874) (← links)
- Infinitary rewriting: closure operators, equivalences and models (Q2376981) (← links)
- Crowd behavior dynamics: entropic path-integral model (Q2380561) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- On explicit substitution with names (Q2392486) (← links)
- A class of bounded functions, a database language and an extended lambda calculus (Q2402281) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- Projections for infinitary rewriting (extended version) (Q2424890) (← links)
- The differential method and the causal incompleteness of programming theory in molecular biology (Q2426147) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- Expression reduction systems with patterns (Q2467565) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Higher-order unification: a structural relation between Huet's method and the one based on explicit substitutions (Q2480966) (← links)
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG (Q2493750) (← links)
- Investigations on the dual calculus (Q2503329) (← links)
- A modern elaboration of the ramified theory of types (Q2563450) (← links)