Recursion induction principle revisited

DOI10.1016/0304-3975(83)90142-1MaRDI QIDQ1838286zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3972168 (Why is no real title available?)
• scientific article; zbMATH DE number 3684895 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3564292 (Why is no real title available?)
• scientific article; zbMATH DE number 3567993 (Why is no real title available?)
• scientific article; zbMATH DE number 3597848 (Why is no real title available?)
• scientific article; zbMATH DE number 3630184 (Why is no real title available?)
• scientific article; zbMATH DE number 3631906 (Why is no real title available?)
• scientific article; zbMATH DE number 3430635 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A representation of trees by languages. II
• Another recursion induction principle
• Completeness results for the equivalence of recursive schemas
• Correct Computation Rules for Recursive Languages
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• On context-free languages and push-down automata
• On some classes of interpretations
• Program equivalence and context-free grammars
• Proving Properties of Programs by Structural Induction
• Proving and applying program transformations expressed with second-order patterns
• Strict deterministic grammars

This page was built for publication: Recursion induction principle revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838286)