scientific article; zbMATH DE number 4005580

MaRDI QIDQ3756499zbMATH OpenFDO

Authors Gérard Berry, Pierre-Louis Curien

Publication date 1985

zbMATH Keywords

algorithmsapplicative programming language CDSCartesian Closed CategoryCDS programsConcrete Data Structuresevaluation strategiesmodels of lambda calculussemantics

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1531369
• scientific article; zbMATH DE number 4048997
• Towards a theory of parallel algorithms on concrete data structures
• scientific article; zbMATH DE number 3976319
• scientific article; zbMATH DE number 3952011

Cited in

(12)

• Domain theory in logical form
• About primitive recursive algorithms
• Towards a theory of parallel algorithms on concrete data structures
• A specification structure for deadlock-freedom of synchronous processes
• Definability and full abstraction
• scientific article; zbMATH DE number 519792 (Why is no real title available?)
• What is a universal higher-order programming language?
• Full abstraction and the Context Lemma (preliminary report)
• Redexes are stable in the -calculus
• Sequential functions on indexed domains and full abstraction for a sub-language of PCF
• Concrete data structures and functional parallel programming
• Specification structures and propositions-as-types for concurrency

This page was built for publication:

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