scientific article

zbMATH Open0619.68008MaRDI QIDQ3756499FDOQ3756499

Pierre-Louis Curien, Gérard Berry

Publication date: 1985

Title of this publication is not available (Why is that?)

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)

Cited In (11)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Towards a theory of parallel algorithms on concrete data structures 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)