scientific article; zbMATH DE number 1531624

zbMATH Open0968.68018MaRDI QIDQ4513619FDOQ4513619

Author name not available (Why is that?)

Publication date: 19 November 2000

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (75)

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

   Recommendations

• Practical foundations for programming languages 👍 👎
• Arnon Avron on semantics and proof theory of non-classical logics 👍 👎
• Insight, inspiration and collaboration 👍 👎
• Logic and Computation 👍 👎
• Theories of Programming 👍 👎

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 Q4513619)