Acceptable functional programming systems

DOI10.1007/BF00268076zbMath0571.68033OpenAlexW1988927884MaRDI QIDQ1061487

L. Duponcheel, M. Duponcheel

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00268076

zbMATH Keywords

computable operatorsrecursion theoremleast fixed pointsubstitution operatorsfixed point function

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial abstract types
• Can programming be liberated from the von Neumann style?
• Inductive methods for proving properties of programs
• A multiscale subgrid model for both free vortex flows and wall-bounded flows

This page was built for publication: Acceptable functional programming systems