The following pages link to (Q4513619):
Displaying 50 items.
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation (Q287361) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- A dynamic deontic logic for complex contracts (Q444496) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- Constructive semantics for instantaneous reactions (Q631753) (← links)
- Structural operational semantics through context-dependent behaviour (Q638568) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Implementing type systems for the IDE with Xsemantics (Q739624) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- A closer look at constraints as processes (Q844200) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- A basic algebra of stateless connectors (Q860881) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- A metamodel for the design of polychronous systems (Q1014564) (← links)
- Primitives for authentication in process algebras. (Q1603653) (← links)
- Compositional SOS and beyond: A coalgebraic view of open systems (Q1603820) (← links)
- The cones and foci proof technique for timed transition systems (Q1607115) (← links)
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- A game semantics for generic polymorphism (Q1772770) (← links)
- An ``abstract process'' approach to algebraic dynamic architecture description (Q1779318) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Modular structural operational semantics (Q1878712) (← links)
- On the \(\lambda Y\) calculus (Q1886326) (← links)
- Bialgebraic foundations for the operational semantics of string diagrams (Q2051792) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Eager functions as processes (Q2123050) (← links)
- On distributability (Q2123059) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- Relational presheaves, change of base and weak simulation (Q2341703) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- Modelling dynamic web data (Q2566029) (← links)
- On the Relative Expressive Power of Calculi for Mobility (Q2805161) (← links)
- Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic (Q2841275) (← links)
- Comparing cospan-spans and tiles via a Hoare-style process calculus (Q2841276) (← links)
- A categorical framework for typing CCS-style process communication (Q2841310) (← links)
- A Calculus of Global Interaction based on Session Types (Q2864218) (← links)
