scientific article
From MaRDI portal
Publication:3756499
zbMath0619.68008MaRDI QIDQ3756499
Pierre-Louis Curien, Gérard Berry
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmssemanticsCartesian Closed Categorymodels of lambda calculusevaluation strategiesapplicative programming language CDSCDS programsConcrete Data Structures
Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) General topics in the theory of software (68N01)
Related Items (10)
Sequential functions on indexed domains and full abstraction for a sub-language of PCF ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ Domain theory in logical form ⋮ About primitive recursive algorithms ⋮ What is a universal higher-order programming language? ⋮ Towards a theory of parallel algorithms on concrete data structures ⋮ Concrete data structures and functional parallel programming ⋮ Definability and Full Abstraction ⋮ Redexes are stable in the λ-calculus
This page was built for publication:
