scientific article; zbMATH DE number 3907742
From MaRDI portal
Publication:3685159
Recommendations
- Inference rules for proving the equivalence of recursive procedures
- Operational and semantic equivalence between recursive programs.
- Inference rules for proving the equivalence of recursive procedures
- scientific article; zbMATH DE number 3947605
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Cites work
- Fixed-point constructions in order-enriched categories
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3430635 (Why is no real title available?)
- scientific article; zbMATH DE number 3304881 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- Improving programs by the introduction of recursion
- Notes on recursion elimination
Cited in
(11)- Pseudo-recursive procedures
- Simulating finitely recursive processes in LISP
- Modular verification of procedure equivalence in the presence of memory allocation
- Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations
- Inference rules for proving the equivalence of recursive procedures
- scientific article; zbMATH DE number 3911681 (Why is no real title available?)
- scientific article; zbMATH DE number 3947605 (Why is no real title available?)
- scientific article; zbMATH DE number 1927430 (Why is no real title available?)
- Operational and semantic equivalence between recursive programs.
- CONCUR 2003 - Concurrency Theory
- Inference rules for proving the equivalence of recursive procedures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685159)
