 | 2009 |
|---|
| 61 |       | Sergey Goncharov,
Lutz Schröder,
Till Mossakowski:
Kleene Monads: Handling Iteration in a Framework of Generic Effects.
CALCO 2009: 18-33 |
| 60 | | Michael Kohlhase,
Johannes Lemburg,
Lutz Schröder,
Ewaryst Schulz:
Formal Management of CAD/CAM Processes.
FM 2009: 223-238 |
| 59 | | Rob Myers,
Dirk Pattinson,
Lutz Schröder:
Coalgebraic Hybrid Logic.
FOSSACS 2009: 137-151 |
| 58 | | Lutz Schröder,
Dirk Pattinson,
Clemens Kupke:
Nominals for Everyone.
IJCAI 2009: 917-922 |
| 57 | | Lutz Schröder,
Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics.
STACS 2009: 673-684 |
| 56 | | Dirk Pattinson,
Lutz Schröder:
Generic Modal Cut Elimination Applied to Conditional Logics.
TABLEAUX 2009: 280-294 |
| 55 | | Lutz Schröder,
Dirk Pattinson:
PSPACE bounds for rank-1 modal logics.
ACM Trans. Comput. Log. 10(2): (2009) |
| 54 | | Lutz Schröder,
Dirk Pattinson:
Strong Completeness of Coalgebraic Modal Logics
CoRR abs/0902.2072: (2009) |
| 53 | | Georgel Calin,
Rob Myers,
Dirk Pattinson,
Lutz Schröder:
CoLoSS: The Coalgebraic Logic Satisfiability Solver.
Electr. Notes Theor. Comput. Sci. 231: 41-54 (2009) |
| 52 | | Lutz Schröder,
Till Mossakowski:
HasCasl: Integrated higher-order specification and program development.
Theor. Comput. Sci. 410(12-13): 1217-1260 (2009) |
| 2008 |
|---|
| 51 | | Corina Cîrstea,
Alexander Kurz,
Dirk Pattinson,
Lutz Schröder,
Yde Venema:
Modal Logics are Coalgebraic.
BCS Int. Acad. Conf. 2008: 128-140 |
| 50 | | Till Mossakowski,
Lutz Schröder,
Sergey Goncharov:
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects.
FASE 2008: 199-214 |
| 49 | | Dirk Pattinson,
Lutz Schröder:
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.
FoSSaCS 2008: 66-80 |
| 48 | | Lutz Schröder,
Dirk Pattinson:
Shallow Models for Non-iterative Modal Logics.
KI 2008: 324-331 |
| 47 |  | Lutz Schröder,
Dirk Pattinson:
How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics.
KR 2008: 307-317 |
| 46 | | Lutz Schröder,
Dirk Pattinson:
The craft of model making: PSPACE bounds for non-iterative modal logics
CoRR abs/0802.0116: (2008) |
| 45 | | Lutz Schröder:
Bootstrapping Inductive and Coinductive Types in HasCASL
CoRR abs/0812.3836: (2008) |
| 44 | | Dirk Pattinson,
Lutz Schröder:
Admissibility of Cut in Coalgebraic Logics.
Electr. Notes Theor. Comput. Sci. 203(5): 221-241 (2008) |
| 43 | | Lutz Schröder:
Bootstrapping Inductive and Coinductive Types in HasCASL.
Logical Methods in Computer Science 4(4): (2008) |
| 42 | | Lutz Schröder:
Expressivity of coalgebraic modal logic: The limits and beyond.
Theor. Comput. Sci. 390(2-3): 230-247 (2008) |
| 2007 |
|---|
| 41 | | Lutz Schröder:
Bootstrapping Types and Cotypes in HasCASL.
CALCO 2007: 447-461 |
| 40 | | Stefan Wölfl,
Till Mossakowski,
Lutz Schröder:
Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables.
FLAIRS Conference 2007: 665- |
| 39 | | Lutz Schröder,
Dirk Pattinson:
Modular Algorithms for Heterogeneous Modal Logics.
ICALP 2007: 459-471 |
| 38 | | Lutz Schröder,
Dirk Pattinson:
Rank-1 Modal Logics Are Coalgebraic.
STACS 2007: 573-585 |
| 37 | | Lutz Schröder,
Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics
CoRR abs/0706.4044: (2007) |
| 36 | | Lutz Schröder:
A finite model construction for coalgebraic modal logic.
J. Log. Algebr. Program. 73(1-2): 97-110 (2007) |
| 2006 |
|---|
| 35 | | Lutz Schröder:
A Finite Model Construction for Coalgebraic Modal Logic.
FoSSaCS 2006: 157-171 |
| 34 | | Lutz Schröder,
Dirk Pattinson:
PSPACE Bounds for Rank-1 Modal Logics.
LICS 2006: 231-242 |
| 33 | | Sergey Goncharov,
Lutz Schröder,
Till Mossakowski:
Completeness of Global Evaluation Logic.
MFCS 2006: 447-458 |
| 32 | | Lutz Schröder,
Till Mossakowski:
Coalgebraic Modal Logic in CoCasl.
WADT 2006: 127-141 |
| 31 | | Till Mossakowski,
Lutz Schröder,
Markus Roggenbach,
Horst Reichel:
Algebraic-coalgebraic specification in CoCasl.
J. Log. Algebr. Program. 67(1-2): 146-197 (2006) |
| 30 | | Lutz Schröder:
The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus.
Theor. Comput. Sci. 353(1-3): 1-25 (2006) |
| 29 | | Daniel Hausmann,
Till Mossakowski,
Lutz Schröder:
A coalgebraic approach to the semantics of the ambient calculus.
Theor. Comput. Sci. 366(1-2): 121-143 (2006) |
| 2005 |
|---|
| 28 | | Daniel Hausmann,
Till Mossakowski,
Lutz Schröder:
Towards a Coalgebraic Semantics of the Ambient Calculus.
CALCO 2005: 232-246 |
| 27 | | Dennis Walter,
Lutz Schröder,
Till Mossakowski:
Parametrized Exceptions.
CALCO 2005: 424-438 |
| 26 | | Daniel Hausmann,
Till Mossakowski,
Lutz Schröder:
Iterative Circular Coinduction for CoCasl in Isabelle/HOL.
FASE 2005: 341-356 |
| 25 | | Lutz Schröder:
Expressivity of Coalgebraic Modal Logic: The Limits and Beyond.
FoSSaCS 2005: 440-454 |
| 24 | | Stefan Wölfl,
Till Mossakowski,
Lutz Schröder:
Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables.
Spatial Cognition: Specialization and Integration 2005 |
| 23 | | Lutz Schröder,
Till Mossakowski,
Andrzej Tarlecki,
Bartek Klin,
Piotr Hoffman:
Amalgamation in the semantics of CASL.
Theor. Comput. Sci. 331(1): 215-247 (2005) |
| 2004 |
|---|
| 22 | | Lutz Schröder,
Till Mossakowski:
Generic Exception Handling and the Java Monad.
AMAST 2004: 443-459 |
| 21 | | Lutz Schröder:
The Logic of the Partial lambda-Calculus with Equality.
CSL 2004: 385-399 |
| 20 | | Lutz Schröder,
Till Mossakowski,
Christoph Lüth:
Type Class Polymorphism in an Institutional Framework.
WADT 2004: 234-251 |
| 19 | | Christoph Lüth,
Markus Roggenbach,
Lutz Schröder:
CCC - The Casl Consistency Checker.
WADT 2004: 94-105 |
| 18 | | Lutz Schröder,
Till Mossakowski:
Monad-independent Dynamic Logic in HasCasl.
J. Log. Comput. 14(4): 571-619 (2004) |
| 2003 |
|---|
| 17 | | Lutz Schröder:
Henkin Models of the Partial sigma-Calculus.
CSL 2003: 498-512 |
| 16 | | Lutz Schröder,
Till Mossakowski:
Monad-Independent Hoare Logic in HASCASL.
FASE 2003: 261-277 |
| 15 | | Till Mossakowski,
Markus Roggenbach,
Lutz Schröder:
CoCASL at Work -- Modelling Process Algebra.
Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 2002 |
|---|
| 14 | | Lutz Schröder,
Till Mossakowski:
HASCASL: Towards Integrated Specification and Development of Functional Programs.
AMAST 2002: 99-116 |
| 13 | | Till Mossakowski,
Horst Reichel,
Markus Roggenbach,
Lutz Schröder:
Algebraic-Coalgebraic Specification in Co Casl.
WADT 2002: 376-392 |
| 12 | | Lutz Schröder,
Till Mossakowski:
Monad-Independent Dynamic Logic in Has Casl.
WADT 2002: 425-441 |
| 11 | | Lutz Schröder:
Monads on Composition Graphs.
Applied Categorical Structures 10(3): 221-236 (2002) |
| 10 | | Lutz Schröder:
Classifying categories for partial equational logic.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 9 | | Lutz Schröder,
Paulo Mateus:
Universal Aspects of Probabilistic Automata.
Mathematical Structures in Computer Science 12(4): 481-512 (2002) |
| 2001 |
|---|
| 8 | | Lutz Schröder:
Life without the Terminal Type.
CSL 2001: 429-442 |
| 7 | | Lutz Schröder,
Till Mossakowski,
Andrzej Tarlecki,
Bartek Klin,
Piotr Hoffman:
Semantics of Architectural Specifications in CASL.
FASE 2001: 253-268 |
| 6 | | Lutz Schröder,
Till Mossakowski,
Andrzej Tarlecki:
Amalgamation in CASL via Enriched Signatures.
ICALP 2001: 993-1004 |
| 5 | | Bartek Klin,
Piotr Hoffman,
Andrzej Tarlecki,
Lutz Schröder,
Till Mossakowski:
Checking Amalgamability Conditions for C ASL Architectural Specifications.
MFCS 2001: 451-463 |
| 4 | | Markus Roggenbach,
Lutz Schröder:
Towards Trustworthy Specifications I: Consistency Checks.
WADT 2001: 305-327 |
| 3 | | Lutz Schröder,
Horst Herrlich:
Free Factorizations.
Applied Categorical Structures 9(6): 571-593 (2001) |
| 2000 |
|---|
| 2 | | Lutz Schröder,
Horst Herrlich:
Free Adjunction of Morphisms.
Applied Categorical Structures 8(4): 595-606 (2000) |
| 1999 |
|---|
| 1 | | Markus Roggenbach,
Lutz Schröder,
Till Mossakowski:
Specifying Real Numbers in CASL.
WADT 1999: 146-161 |
