default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Structures in Computer Science, Volume 12
Volume 12, Number 1, 2002
- Loïc Colson:
Syntactical Truth Predicates for Formulas with Atomic Negation. 1-18 - Sara Negri:
Continuous Domains as Formal Spaces. 19-52 - Roberto Bruni, José Meseguer, Ugo Montanari:
Symmetric Monoidal and Cartesian Double Categories as a Semantic Framework for Tile Logic. 53-90 - Paolo Boldi
, Felice Cardone, Manfred Droste:
Universal Homogeneous Graph-Like Structures And Domains. 91-109
Volume 12, Number 2, 2002
- Andrzej Ehrenfeucht, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
String and Graph Reduction Systems for Gene Assembly in Ciliates. 113-134 - Renate Klempien-Hinrichs:
Normal Forms for Context-Free Node-Rewriting Hypergraph Grammars. 135-148 - Barbara König:
Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems. 149-175 - Peter Burmeister, Mercè Llabrés, Francesc Rosselló:
Pushout Complements for Partly Total Algebras. 177-201 - Bruno Courcelle, Johann A. Makowsky:
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. 203-235
Volume 12, Number 3, 2002
- Jaap van Oosten:
Realizability: A Historical Essay. 239-263 - Andrew M. Pitts:
Tripos Theory in Retrospect. 265-279 - Ulrich Berger:
Computability and Totality in Domains. 281-294 - J. M. E. Hyland:
Variations on Realizability: Realizing the Propositional Axiom of Choice. 295-317 - Steven Awodey, Lars Birkedal, Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability. 319-334 - Peter Lietz, Thomas Streicher:
Impredicativity entails Untypedness. 335-347
Volume 12, Number 4, 2002
- Reiko Heckel, Mercè Llabrés, Hartmut Ehrig, Fernando Orejas:
Concurrency and Loose Semantics of Open Graph Transformation Systems. 349-376 - Loïc Hélouët, Claude Jard, Benoît Caillaud:
An Event Structure Based Semantics for High-Level Message Sequence Charts. 377-402 - Javier Larrosa, Gabriel Valiente:
Constraint Satisfaction Algorithms for Graph Pattern Matching. 403-422 - Nico Verlinden, Dirk Janssens:
Algebraic Properties Of Processes for Local Action Systems. 423-448 - Paul-André Melliès:
Double Categories: A Modular Model of Multiplicative Linear Logic. 449-479 - Lutz Schröder, Paulo Mateus:
Universal Aspects of Probabilistic Automata. 481-512 - Richard Blute, J. Robin B. Cockett, Robert A. G. Seely:
The Logic of Linear Functors. 513-539
Volume 12, Number 5, 2002
- Grigore Rosu:
Axiomatizability in Inclusive Equational Logics. 541-563 - H. Peter Gumm, Tobias Schröder:
Coalgebras Of Bounded Type. 565-578 - Thomas Ehrhard:
On Köthe Sequence Spaces and Linear Logic. 579-623 - Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott:
Geometry of Interaction and Linear Combinatory Algebras. 625-665 - Stefan Sokolowski:
Investigation of Concurrent Processes by Means of Homotopy Functors. 665-699
Volume 12, Number 6, 2002
- Davide Ancona, Elena Zucca:
A Theory of Mixin Modules: Algebraic Laws and Reduction Semantics. 701-737 - Matías Menni, Alex K. Simpson:
Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces. 739-770 - Daniel Fridlender:
A Proof-Irrelevant Model of Martin-Löf's Logical Framework. 771-795 - Sylvain Lippi:
Encoding Left Reduction in the Lambda-Calculus with Interaction Nets. 797-822 - Stefano Berardi, Chantal Berline:
BetaEta-Complete Models for System F. 823-874 - Bart Jacobs:
The Temporal Logic of Coalgebras via Galois Algebras. 875-903
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-06 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
