The following pages link to (Q5685626):
Displaying 50 items.
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- Mechanised wire-wise verification of Handel-C synthesis (Q436367) (← links)
- VDM semantics of programming languages: Combinators and monads (Q539163) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- Modular tree transducers (Q807012) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- Orthogonality of information structures (Q1141477) (← links)
- The congruence of two programming language definitions (Q1155952) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Theory construction in psychology: The interpretation and integration of psychological data (Q1157291) (← links)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable (Q1162807) (← links)
- Fixed point theorems and semantics: A folk tale (Q1166268) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Abstract data types and algebraic semantics of programming languages (Q1171877) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- Proving a compiler correct: A simple approach (Q1216945) (← links)
- SEMANOL (73), a metalanguage for programming the semantics of programming languages (Q1219158) (← links)
- Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Computability concepts for programming language semantics (Q1235972) (← links)
- PASCAL in LCF: Semantics and examples of proof (Q1242670) (← links)
- Fully abstract models of typed \(\lambda\)-calculi (Q1249567) (← links)
- A theory of type polymorphism in programming (Q1250704) (← links)
- Program transformations and algebraic semantics (Q1254849) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
- An algebraic approach to semantics of programming languages (Q1346625) (← links)
- The common order-theoretic structure of version spaces and ATMSs (Q1389537) (← links)
- Compositional meaning in logic (Q1682292) (← links)
- A brief history of process algebra (Q1781995) (← links)
- On Scott's thesis for domains of information and well-quasi-orderings (Q1813971) (← links)
- Toward an infinitary logic of domains: Abramsky logic for transition systems (Q1854320) (← links)
- The regular-language semantics of second-order idealized ALGOL (Q1884909) (← links)
- A representation of FS-domains by formal concept analysis (Q2064935) (← links)
- A category of quantum posets (Q2088113) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Whither semantics? (Q2286732) (← links)
- Proof, meaning and paradox: some remarks (Q2288280) (← links)
- On paradoxes in normal form (Q2288281) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- A presheaf environment for the explicit fusion calculus (Q2392481) (← links)
