scientific article; zbMATH DE number 3793435
From MaRDI portal
Publication:3969890
Cited in
(only showing first 100 items - show all)- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Operational semantics: concepts and their expression
- A construction of one-point bases in extended lambda calculi
- Axiomatising finite delay operators
- Specification-oriented semantics for communicating processes
- The description of the characteristics of the structure and the quantity in fixed pansystems theorems
- A characterization of Plotkin's order in powerdomains, and some of its properties
- A structural operational semantics for an Edison-like language
- A simple fixpoint argument without the restriction to continuity
- A view of programming languages as symbiosis of meaning and computations
- On merging software extensions
- Merging regular processes by means of fixed-point theory
- An algebraic semantics approach to the effective resolution of type equations
- Strictness analysis and denotational abstract interpretation
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- SIMD language design using prescriptive semantics
- Semantics of production systems
- Existential continuation
- The semantics of lazy functional languages
- Petri nets, event structures and domains. I
- The independence of control structures in abstract programming systems
- The congruence of two programming language definitions
- Some primitives for the portable programming of array and vector processors
- Free upper regular bands
- A dual problem to least fixed points
- The IO- and OI-hierarchies
- Specifications, models, and implementations of data abstractions
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- Fixed point theorems and semantics: A folk tale
- Domain theory in logical form
- Relation algebraic domain constructions
- The contraction principle as a particular case of Kleene's fixed point theorem
- Semantics and reasoning with free procedures
- Universal algebra in higher types
- A lattice for abstract interpretation of dynamic (LISP-like) structures
- Structured meanings and reflexive domains
- A syntactic theory of sequential state
- Quantitative semantics, topology, and possibility measures
- On a generalized product for domains
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Correct translation of data parallel assignment onto array processors
- Testing equivalences for processes
- Attribute and unification grammar: A review and analysis of formalisms
- Fuzzy semantic analysis and formal specification of conceptual knowledge
- A fuzzy language.
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- A cost-effective estimation of uncaught exceptions in Standard ML programs
- Compositional meaning in logic
- A semantic framework for proof evidence
- Semantics of non-deterministic possibility computation
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
- A ``geometric view of the dynamics of trajectories of computer programs
- On Scott's thesis for domains of information and well-quasi-orderings
- Incorporating static analysis in a combinator-based compiler
- Describing semantic domains with sprouts
- Coalgebras and monads in the semantics of Java
- The origins of structural operational semantics
- A multi-tier semantics for Hop
- An abstract theory of physical measurements
- Metrizability of partial metric spaces
- Trace semantics and algebraic laws for MCA ARMv8 architecture based on UTP
- Dependent vector types for data structuring in multirate Faust
- Compactness and completeness in partial metric spaces
- On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
- Computability and realizability for interactive computations
- A reduction semantics for direct-style asynchronous observables
- Verifying of interface assertions for infinite state Mealy machines
- Recursive programs and denotational semantics in absolute logics of programs
- A domain equation for bisimulation
- On the geometry of physical measurements: topological and algebraic aspects
- A domain-theoretic model of nominally-typed object-oriented programming
- A rewrite framework for language definitions and for generation of efficient interpreters
- rCOS: defining meanings of component-based software architectures
- Continuity in semantic theories of programming
- An abstract interface to higher spin gauge field theory
- The use of hoare logic in the verification of horizontal microprograms
- Propositional dynamic logic for reasoning about first-class agent interaction protocols
- Coupled Meir-Keeler type contraction in metric spaces with an application to partial metric spaces
- A formal semantics for sql
- Parallélisation sémantique
- From reduction-based to reduction-free normalization
- In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
- A denotational semantics for the generalized ER model and a simple ER algebra
- Logic and functional programming by retractions
- Logic and functional programming by retractions : operational semantics
- Specifying termination in CSP
- An order-algebraic definition of knuthian semantics
- Foundations of a theorem prover for functional and mathematical uses
- scientific article; zbMATH DE number 1022228 (Why is no real title available?)
- Fixed point theorems for nonlinear contractions in ordered partial metric spaces
- Incorporating an implicit time dimension into the relational model and algebra
- Characterizations of semantic domains for randomized algorithms
- Unifying Semantics for Concurrent Programming
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Pixel Geometry
- Formalizing operational semantic specifications in logic
- Semantics-directed program analysis: a tool-maker's perspective
- A first order logic for partial functions (extended abstract)
- On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
- Quantitative Verification of Stochastic Regular Expressions
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 Q3969890)
