scientific article; zbMATH DE number 1531624
From MaRDI portal
Publication:4513619
Festschriften (00B30) Combinatory logic and lambda calculus (03B40) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Theory of programming languages (68N15) 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
(89)- Comparing communication primitives via their relative expressive power
- A metamodel for the design of polychronous systems
- 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
- Rewriting logic: Roadmap and bibliography
- On the validity of encodings of the synchronous in the asynchronous -calculus
- A calculus for reasoning about software composition
- A game semantics for generic polymorphism
- An ``abstract process approach to algebraic dynamic architecture description
- Normal forms for algebras of connections.
- Decoding choice encodings
- Full abstraction for PCF
- Modular structural operational semantics
- On the \(\lambda Y\) calculus
- Arnon Avron on semantics and proof theory of non-classical logics
- Bialgebraic foundations for the operational semantics of string diagrams
- Processes against tests: on defining contextual equivalences
- Eager functions as processes
- On distributability
- Bisimulation and coinduction enhancements: a historical perspective
- Relational presheaves, change of base and weak simulation
- Continuity controlled hybrid automata
- Recursively defined metric spaces without contraction
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Axiomatizing weighted synchronization trees and weighted bisimilarity
- Tutorial on separation results in process calculi via leader election problems
- Modelling dynamic web data
- Foundations of Boolean stream runtime verification
- On the relative expressive power of calculi for mobility
- 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
- A calculus of global interaction based on session types
- Lightweight static capabilities
- Synchrony vs asynchrony in communication primitives
- Expressiveness of process algebras
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation
- Formalisation vs. understanding. A case study in Isabelle
- Proof-producing reflection for HOL. With an application to model polymorphism
- Insight, inspiration and collaboration
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Imperative programs as proofs via game semantics
- scientific article; zbMATH DE number 1222485 (Why is no real title available?)
- A dynamic deontic logic for complex contracts
- 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
- Trees from functions as processes
- Models: concepts, theory, logic, reasoning and semantics. Essays dedicated to Klaus-Dieter Schewe on the occasion of his 60th birthday
- Relating state-based and process-based concurrency through linear logic
- ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT
- Mixed sessions
- Synthesizing SystemC Code from Delay Hybrid CSP
- Characteristics of de Bruijn’s early proof checker Automath
- Compositional specification in rewriting logic
- Flag-based big-step semantics
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
- Robin Milner 1934--2010
- Logic-Free Reasoning in Isabelle/Isar
- Linear realizability and full completeness for typed lambda-calculi
- Efficient verified (UN)SAT certificate checking
- From rewrite rules to bisimulation congruences
- An axiomatic semantics for Esterel
- Specification and verification of concurrent systems by causality and realizability
- Jifeng He at Oxford and beyond: an appreciation
- Runtime verification of real-time event streams using the tool HStriver
- Constructive semantics for instantaneous reactions
- Structural operational semantics through context-dependent behaviour
- Graph Rewriting Components
- Samson Abramsky on logic and structure in computer science and beyond
- A formal library of set relations and its application to synchronous languages
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- Towards the complexity analysis of programming language proof methods
- A denotationally-based program logic for higher-order store
- Q\# as a quantum algorithmic language
- CONCUR test-of-time award for the period 1994--97 interview with Uwe Nestmann and Benjamin C. Pierce
- Differentiable causal computations via delayed trace (extended version)
- Relating state-based and process-based concurrency through linear logic (full-version)
- The HOL-CSP Refinement Toolkit
- HOL-CSP Version 2.0
- A Sound Type System for Physical Quantities, Units, and Measurements
- Implementing type systems for the IDE with Xsemantics
- N. G. de Bruijn's contribution to the formalization of mathematics
- A closer look at constraints as processes
- A concurrent lambda calculus with futures
- A basic algebra of stateless connectors
- Innovations in computational type theory using Nuprl
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)
