Reductivity
From MaRDI portal
Publication:1916366
DOI10.1016/0167-6423(95)00027-5zbMATH Open0848.68054DBLPjournals/scp/DoornbosB96OpenAlexW4212784955WikidataQ56874030 ScholiaQ56874030MaRDI QIDQ1916366FDOQ1916366
Henk Doornbos, Roland C. Backhouse
Publication date: 11 September 1996
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(95)00027-5
Recommendations
Cited In (13)
- Reduction Under Substitution
- Nondeterministic semantics of compound diagrams
- A calculational approach to mathematical induction
- Assertions and recursions
- Formal derivation of greedy algorithms from relational specifications: a tutorial
- Datatype-generic termination proofs
- Guyan reduction
- Value-free reductions
- Intrinsic Reducibilities
- Algebra of programming in Agda: Dependent types for relational program derivation
- On reduction properties
- Analog reducibility
- Reductive modes
This page was built for publication: Reductivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916366)