scientific article; zbMATH DE number 4048997
From MaRDI portal
Publication:3785893
Cited in
(91)- On the implementation of abstract data types by programming language constructs
- Two-level semantics and code generation
- The linear abstract machine
- Algebra of constructions. I. The word problem for partial algebras
- 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 - 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
- Event structures and domains
- A notation for lambda terms. A generalization of environments
- On the expansion of non-linear functions
- Universal homogeneous event structures and domains
- Towards a semantics-based information theory
- Quantitative domains and infinitary algebras
- 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
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Comprehension categories and the semantics of type dependency
- Stable trace automata vs. full trace automata
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Context-free event domains are recognizable
- Nonexpressibility of fairness and signaling
- Combinatory reduction systems: Introduction and survey
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Eta-conversion for the languages of explicit substitutions
- Stability, sequentiality and demand driven evaluation in dataflow
- Labelled domains and automata with concurrency
- Label-selective -calculus syntax and confluence
- A useful -notation
- Domain-independent queries on databases with external functions
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- On the algebraic models of lambda calculus
- A unified language processing methodology
- A theory of sequentiality
- Proof of termination of the rewriting system SUBSET on CCL
- Recursive domain equations for concrete data structure
- Projecting sequential algorithms on strongly stable functions
- Exponentiable streams and prestreams
- A relational account of call-by-value sequentiality
- Interdefinability of parallel operations in PCF
- Event domains, stable functions and proof-nets
- Cartesian monoids
- Some improvements to Turner's algorithm for bracket abstraction
- scientific article; zbMATH DE number 4177054 (Why is no real title available?)
- scientific article; zbMATH DE number 4005580 (Why is no real title available?)
- On the efficiency of categorical combinators as a rewriting system
- The Impact of the Lambda Calculus in Logic and Computer Science
- From domains to automata with concurrency
- What is a universal higher-order programming language?
- Explicit substitutions à la de Bruijn: the local and global way
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- scientific article; zbMATH DE number 7362475 (Why is no real title available?)
- On confluence for weakly normalizing systems
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- 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
- Context-free event domains are recognizable
- Strong normalization of substitutions
- scientific article; zbMATH DE number 234028 (Why is no real title available?)
- 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
- 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
- European Summer Meeting of the Association for Symbolic Logic
- Decomposition of domains
- Continuous functions and parallel algorithms on concrete data structures
- Lambda abstraction algebras: representation theorems
- Categorical ML -- category-theoretic modular programming
- Comparing Hagino's categorical programming language and typed lambda- calculi
- On stable domains
- A note on inconsistencies caused by fixpoints in a cartesian closed category
- Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
- Stability and computability in coherent domains
- Termination by completion
- An abstract framework for environment machines
- Comparison of priority rules in pattern matching and term rewriting
- A syntactic correspondence between context-sensitive calculi and abstract machines
- 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
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 Q3785893)
