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
(85)- Proof-producing reflection for HOL. With an application to model polymorphism
- Compositional specification in rewriting logic
- Characteristics of de Bruijn’s early proof checker Automath
- CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
- 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
- A closer look at constraints as processes
- Robin Milner 1934--2010
- Foundations of Boolean stream runtime verification
- Differentiable causal computations via delayed trace (extended version)
- From rewrite rules to bisimulation congruences
- An axiomatic semantics for Esterel
- On distributability
- Eager functions as processes
- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
- 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
- On the \(\lambda Y\) calculus
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation
- A categorical framework for typing CCS-style process communication
- Efficient verified (UN)SAT certificate checking
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- Lightweight static capabilities
- Logic-Free Reasoning in Isabelle/Isar
- Graph Rewriting Components
- Trees from functions as processes
- A dynamic deontic logic for complex contracts
- On the validity of encodings of the synchronous in the asynchronous -calculus
- A concurrent lambda calculus with futures
- Towards the complexity analysis of programming language proof methods
- Full abstraction for PCF
- Arnon Avron on semantics and proof theory of non-classical logics
- Models: concepts, theory, logic, reasoning and semantics. Essays dedicated to Klaus-Dieter Schewe on the occasion of his 60th birthday
- Modular structural operational semantics
- A game semantics for generic polymorphism
- Implementing type systems for the IDE with Xsemantics
- N. G. de Bruijn's contribution to the formalization of mathematics
- Tutorial on separation results in process calculi via leader election problems
- A metamodel for the design of polychronous systems
- Comparing higher-order encodings in logical frameworks and tile logic
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Decoding choice encodings
- Runtime verification of real-time event streams using the tool HStriver
- A denotationally-based program logic for higher-order store
- Insight, inspiration and collaboration
- 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)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Formalisation vs. understanding. A case study in Isabelle
- Expressiveness of process algebras
- Constructive semantics for instantaneous reactions
- ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT
- Bialgebraic foundations for the operational semantics of string diagrams
- Mixed sessions
- Continuity controlled hybrid automata
- Innovations in computational type theory using Nuprl
- Linear realizability and full completeness for typed lambda-calculi
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- A formal library of set relations and its application to synchronous languages
- The cones and foci proof technique for timed transition systems
- Synthesizing SystemC Code from Delay Hybrid CSP
- Normal forms for algebras of connections.
- Synchrony vs asynchrony in communication primitives
- Compositional SOS and beyond: A coalgebraic view of open systems
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
- A calculus of global interaction based on session types
- Samson Abramsky on logic and structure in computer science and beyond
- Specification and verification of concurrent systems by causality and realizability
- Relational presheaves, change of base and weak simulation
- A calculus for reasoning about software composition
- Rewriting logic: Roadmap and bibliography
- Relating state-based and process-based concurrency through linear logic
- 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
- Jifeng He at Oxford and beyond: an appreciation
- Processes against tests: on defining contextual equivalences
- Q\# as a quantum algorithmic language
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)
