Equality between functionals in the presence of coproducts
From MaRDI portal
Publication:1854334
DOI10.1006/inco.1999.2833zbMath1005.03015OpenAlexW2119992134MaRDI QIDQ1854334
Daniel J. Dougherty, Ramesh Subrahmanyam
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f786d80cd4e8aad3ee21accbf2f978b57ae91ea2
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kripke-style models for typed lambda calculus
- The lambda calculus, its syntax and semantics
- Proving termination with multiset orderings
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Completeness, invariance and λ-definability
- A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
- Some lambda calculi with categorical sums and products
This page was built for publication: Equality between functionals in the presence of coproducts
