Recursion induction principle revisited

DOI10.1016/0304-3975(83)90142-1zbMath0509.68023OpenAlexW2055101766MaRDI QIDQ1838286

Laurent Kott, Gérard Boudol

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076445/file/RR-0115.pdf

zbMATH Keywords

recursive programsrecursion induction principlerewriting systems on termsuniversally quantified first-order formulas

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cites Work

• A representation of trees by languages. II
• Program equivalence and context-free grammars
• Completeness results for the equivalence of recursive schemas
• Proving and applying program transformations expressed with second-order patterns
• On some classes of interpretations
• Strict deterministic grammars
• Infinite trees in normal form and recursive equations having a unique solution
• A Transformation System for Developing Recursive Programs
• Correct Computation Rules for Recursive Languages
• Initial Algebra Semantics and Continuous Algebras
• Proving Properties of Programs by Structural Induction
• Another recursion induction principle
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursion induction principle revisited