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