scientific article; zbMATH DE number 3896271
From MaRDI portal
Publication:3675498
zbMATH Open0562.68004MaRDI QIDQ3675498FDOQ3675498
Authors: Francois Lavandier, Bruno Courcelle 
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92206
Title of this publication is not available (Why is that?)
Recommendations
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- Fundamental properties of infinite trees
- Attribute grammars and recursive program schemes. I. II
- Attribute Grammars and Mathematical Semantics
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Program schemes, recursion schemes, and formal languages
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- Proofs by induction in equational theories with constructors
- Proving and applying program transformations expressed with second-order patterns
- The denotational semantics of programming languages
- The Theoretical Aspects of the Optimal Fixedpoint
- Algebraic semantics
- A system which automatically improves programs
- Infinite trees in normal form and recursive equations having a unique solution
- Varieties of ”If-Then-Else“
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Characterization of flowchartable recursions
- Title not available (Why is that?)
- Operational and Semantic Equivalence Between Recursive Programs
- Title not available (Why is that?)
Cited In (1)
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 Q3675498)
