scientific article; zbMATH DE number 3896271

MaRDI QIDQ3675498zbMATH OpenFDO

Authors Francois Lavandier, Bruno Courcelle

Publication date 1984

Full work available at URL https://eudml.org/doc/92206

zbMATH Keywords

denotational semanticsconstructsrecursive definitionsnon- deterministic programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
• scientific article; zbMATH DE number 3924117
• scientific article; zbMATH DE number 2037780
• scientific article; zbMATH DE number 3928338
• scientific article; zbMATH DE number 1163990

Cites work

• scientific article; zbMATH DE number 3810955 (Why is no real title available?)
• scientific article; zbMATH DE number 3821090 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3597848 (Why is no real title available?)
• A system which automatically improves programs
• Algebraic semantics
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• Attribute Grammars and Mathematical Semantics
• Attribute grammars and recursive program schemes. I. II
• Characterization of flowchartable recursions
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• Fundamental properties of infinite trees
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• Operational and Semantic Equivalence Between Recursive Programs
• Program schemes, recursion schemes, and formal languages
• Proofs by induction in equational theories with constructors
• Proving and applying program transformations expressed with second-order patterns
• The Theoretical Aspects of the Optimal Fixedpoint
• The denotational semantics of programming languages
• Tree-Manipulating Systems and Church-Rosser Theorems
• Varieties of ”If-Then-Else“

Cited in

(1)

• Une charpente de semi-unification

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)