scientific article; zbMATH DE number 1531624

No author found.

Publication date: 19 November 2000

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

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Festschriften (00B30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Combinatory logic and lambda calculus (03B40)

Related Items (74)

Rewriting logic: Roadmap and bibliography ⋮ Eager functions as processes ⋮ On distributability ⋮ ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT ⋮ Modular structural operational semantics ⋮ Foundations of Boolean stream runtime verification ⋮ Mixed Sessions ⋮ Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation ⋮ Continuity controlled hybrid automata ⋮ On the $\lambda Y$ calculus ⋮ Recursively defined metric spaces without contraction ⋮ A closer look at constraints as processes ⋮ Synthesizing SystemC Code from Delay Hybrid CSP ⋮ Trees from Functions as Processes ⋮ On the validity of encodings of the synchronous in the asynchronous $\pi$-calculus ⋮ The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems ⋮ A concurrent lambda calculus with futures ⋮ A basic algebra of stateless connectors ⋮ Innovations in computational type theory using Nuprl ⋮ Characteristics of de Bruijn’s early proof checker Automath ⋮ Imperative programs as proofs via game semantics ⋮ Formalisation vs. Understanding ⋮ Proof-Producing Reflection for HOL ⋮ CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Compositional Specification in Rewriting Logic ⋮ Linear-Ordered Graph Grammars: Applications to Distributed Systems Design ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Runtime verification of real-time event streams using the tool HStriver ⋮ Constructive semantics for instantaneous reactions ⋮ Structural operational semantics through context-dependent behaviour ⋮ A dynamic deontic logic for complex contracts ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ A formal library of set relations and its application to synchronous languages ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ Flag-based big-step semantics ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ A calculus for reasoning about software composition ⋮ Linear realizability and full completeness for typed lambda-calculi ⋮ A game semantics for generic polymorphism ⋮ An ``abstract process approach to algebraic dynamic architecture description ⋮ Graph Rewriting Components ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ From rewrite rules to bisimulation congruences ⋮ An axiomatic semantics for Esterel ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis ⋮ Comparing communication primitives via their relative expressive power ⋮ On the Relative Expressive Power of Calculi for Mobility ⋮ Towards the complexity analysis of programming language proof methods ⋮ Implementing type systems for the IDE with Xsemantics ⋮ N. G. de Bruijn's contribution to the formalization of mathematics ⋮ Efficient verified (UN)SAT certificate checking ⋮ A metamodel for the design of polychronous systems ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic ⋮ Comparing cospan-spans and tiles via a Hoare-style process calculus ⋮ A categorical framework for typing CCS-style process communication ⋮ Processes against tests: on defining contextual equivalences ⋮ Modelling dynamic web data ⋮ Logic-Free Reasoning in Isabelle/Isar ⋮ Normal forms for algebras of connections. ⋮ Relational presheaves, change of base and weak simulation ⋮ Decoding choice encodings ⋮ Full abstraction for PCF ⋮ A Calculus of Global Interaction based on Session Types ⋮ Lightweight Static Capabilities ⋮ Synchrony vs Asynchrony in Communication Primitives ⋮ Expressiveness of Process Algebras ⋮ Primitives for authentication in process algebras. ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ The cones and foci proof technique for timed transition systems ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

This page was built for publication: