scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

functional programming lambda-calculus sequential algorithms categorical combinators CDSO semantics of sequential programming languages

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatory logic and lambda calculus (03B40)

Related Items (88)

A generalized Kahn Principle for abstract asynchronous networks ⋮ Connections between a concrete and an abstract model of concurrent systems ⋮ Equationally fully abstract models of PCF ⋮ Eta-conversion for the languages of explicit substitutions ⋮ On the symmetry of sequentiality ⋮ Sequential functions on indexed domains and full abstraction for a sub-language of PCF ⋮ Another approach to sequentiality: Kleene's unimonotone functions ⋮ Linear domains and linear maps ⋮ On the implementation of abstract data types by programming language constructs ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ Labelled domains and automata with concurrency ⋮ On confluence for weakly normalizing systems ⋮ Two-level semantics and code generation ⋮ Cartesian Monoids ⋮ Label-selective \(\lambda\)-calculus syntax and confluence ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Interdefinability of parallel operations in PCF ⋮ The linear abstract machine ⋮ Algebra of constructions. I. The word problem for partial algebras ⋮ A useful \(\lambda\)-notation ⋮ Some improvements to Turner's algorithm for bracket abstraction ⋮ Unique normal forms for lambda calculus with surjective pairing ⋮ Church-Rosser theorem for a rewriting system on categorical combinators ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Decidability of the restriction equational theory in the partial lambda calculus ⋮ Partiality, cartesian closedness, and toposes ⋮ Projecting sequential algorithms on strongly stable functions ⋮ Event structures and domains ⋮ A syntactic correspondence between context-sensitive calculi and abstract machines ⋮ A notation for lambda terms. A generalization of environments ⋮ A matching process modulo a theory of categorical products ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ Declarative continuations: An investigation of duality in programming language semantics ⋮ Domain-independent queries on databases with external functions ⋮ Decomposition of domains ⋮ Continuous functions and parallel algorithms on concrete data structures ⋮ On the efficiency of categorical combinators as a rewriting system ⋮ Codatatypes in ML ⋮ Two-level semantics and abstract interpretation ⋮ A category-theoretic characterization of functional completeness ⋮ Alpha conversion, conditions on variables and categorical logic ⋮ Non-deterministic information systems and their domains ⋮ Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL ⋮ On the expansion of non-linear functions ⋮ Universal homogeneous event structures and domains ⋮ From domains to automata with concurrency ⋮ What is a universal higher-order programming language? ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Towards a semantics-based information theory ⋮ Quantitative domains and infinitary algebras ⋮ Lambda abstraction algebras: representation theorems ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ The chemical abstract machine ⋮ New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic ⋮ Towards a theory of parallel algorithms on concrete data structures ⋮ Categorical ML -- category-theoretic modular programming ⋮ Comparing Hagino's categorical programming language and typed lambda- calculi ⋮ On stable domains ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Comprehension categories and the semantics of type dependency ⋮ Explicit Substitutions à la de Bruijn ⋮ Exponentiable streams and prestreams ⋮ A relational account of call-by-value sequentiality ⋮ A theory of sequentiality ⋮ A note on inconsistencies caused by fixpoints in a cartesian closed category ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic ⋮ Stability and computability in coherent domains ⋮ Termination by completion ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Stable trace automata vs. full trace automata ⋮ Context-free event domains are recognizable ⋮ Proof of termination of the rewriting system SUBSET on CCL ⋮ Recursive domain equations for concrete data structure ⋮ Unnamed Item ⋮ A finite equational axiomatization of the functional algebras for the lambda calculus ⋮ Context-free event domains are recognizable ⋮ Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions ⋮ On the algebraic models of lambda calculus ⋮ Nonexpressibility of fairness and signaling ⋮ Event Domains, Stable Functions and Proof-Nets ⋮ An abstract framework for environment machines ⋮ Combinatory reduction systems: Introduction and survey ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Comparison of priority rules in pattern matching and term rewriting ⋮ A unified language processing methodology ⋮ Strong normalization of substitutions

This page was built for publication: