A methodology for synthesis of recursive functional programs

DOI10.1145/24039.24071MaRDI QIDQ3761673zbMATH OpenOpenAlexFDO

Authors Debasish Banerjee

Publication date 1987

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1987-9/

zbMATH Keywords

example specificationFP program synthesis methodologyFunctional Programmingleast fixed pointrecursive FP programsreduction semanticstransformation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A knowledge-based approach to program synthesis from examples
• scientific article; zbMATH DE number 3976296
• scientific article; zbMATH DE number 3864470
• scientific article; zbMATH DE number 4124987
• scientific article; zbMATH DE number 3856378

Cited in

(9)

• A technique for solving a class of quadratic FP equations
• Unraveling recursion: compiling an IR with recursion to System F
• A knowledge-based approach to program synthesis from examples
• Recursion equations as a programming language
• scientific article; zbMATH DE number 3864470 (Why is no real title available?)
• Structuring FP-style functional programs
• scientific article; zbMATH DE number 3976296 (Why is no real title available?)
• scientific article; zbMATH DE number 572175 (Why is no real title available?)
• Synthesis of parallel recursive programs in structural functional models

This page was built for publication: A methodology for synthesis of recursive functional programs

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