scientific article; zbMATH DE number 4005580

MaRDI QIDQ3756499zbMATHFDO

Authors Gérard Berry, Pierre-Louis Curien

Publication date 1985

zbMATH Keywords

algorithmssemanticsCartesian Closed Categorymodels of lambda calculusevaluation strategiesapplicative programming language CDSCDS programsConcrete Data Structures

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

(11)

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

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)