Functional programs that explain their work

DOI10.1145/2364527.2364579MaRDI QIDQ5168916zbMATH OpenOpenAlexFDO

Authors Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy

Publication date 21 July 2014

Published in Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.960.5102

zbMATH Keywords

debuggingprogram slicingprovenance

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Functional programs as executable specifications
• The Functional Approach to Programming
• scientific article; zbMATH DE number 4024746
• scientific article; zbMATH DE number 1090656
• scientific article; zbMATH DE number 6268799
• scientific article; zbMATH DE number 2036335
• Functional differentiation of computer programs
• Functional differentiation of computer programs
• Functional differentiation of computer programs
• Design and analysis of purely functional programs.

Cited in

(8)

• Dynamic slicing of lazy functional programs based on redex trails
• When is a functional program not a functional program?
• Explainable dynamic programming
• Functional differentiation of computer programs
• Adaptable Traces for Program Explanations
• Context-sensitive meta-constraint systems for explainable program analysis
• Proof-relevant -calculus
• A theory of fine-grained lineage for functions on structured objects

This page was built for publication: Functional programs that explain their work

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