Lutz Schröder: List of Publications (by year)

Go to year:  to appear   2012   2011   2010   2009   2008   2007   2006   2005   2004   2003   2002   2001   2000   1999 

to appear     Back to top

	Christoph Hertzberg, René Wagner, Udo Frese, Lutz Schröder. Integrating Generic Sensor Fusion Algorithms with Sound State Representation through Encapsulation of Manifolds. In Information Fusion. In Press. Preprint available on arXiv as eprint 1107.1119.
	Dirk Pattinson, Lutz Schröder. Generic Modal Cut Elimination Applied to Conditional Logics. In Log. Methods Comput. Sci. To appear.

2012     Back to top

Daniel Gorín, Lutz Schröder (2012). Narcisissts are easy, stepmothers are hard. In Lars Birkedal (Ed.), Foundations of Software Science and Computation Structures, FOSSACS 2012, Vol. 7213, pp. 240–254, Lecture Notes in Computer Science. Springer.

2011     Back to top

	Victor Gutierrez Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder (2011). The Complexity of Probabilistic EL. In Sebastian Rudolph, Michael Zakharyaschev (Eds.), Proc. 24th International Workshop on Description Logics (DL 2011) , CEUR-WS online proceedings. To appear.
	Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema (2011). Modal logics are coalgebraic. In The Computer Journal, 54 (1), pp. 31–41. Extends (Cirstea et al. 2008)..
	Dominik Dietrich, Lutz Schröder, Ewaryst Schulz (2011). Formalizing and Operationalizing Industrial Standards. In Dimitra Giannakopoulou, Fernando Orejas (Eds.), Fundamental Approaches to Software Engineering (FASE 2011), Vol. 6603, pp. 81–95, Lecture Notes in Computer Science. Springer.
	Marco Franke, Patrick Klein, Lutz Schröder (2011). Ontological Semantics of Standards and PLM Repositories in the Product Development Phase. In Alain Bernard (Ed.), Global Product Developement: Proc. of the 20th CIRP Design Conference, 2010, pp. 473–482. Springer.
	Sergey Goncharov, Lutz Schröder (2011). Powermonads and Tensors of Unranked Effects. In Martin Grohe (Ed.), Logic in Computer Science (LICS 2011). IEEE Computer Society. To appear.
	Victor Gutierrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder (2011). A Closer Look at the Probabilistic Description Logic Prob-EL. In Wolfram Burgard, Dan Roth (Eds.), Proc. 25th Conference on Artificial Intelligence (AAAI-11), pp. 197–202. AAAI Press.
	Lutz Schröder, Dirk Pattinson (2011). Modular Algorithms for Heterogeneous Modal Logics via Multi-Sorted Coalgebra. In Math. Struct. Comput. Sci., 21 (2), pp. 235–266. Copyright Cambridge University Press.
	Lutz Schröder, Dirk Pattinson (2011). Description Logics and Fuzzy Probability. In Toby Walsh (Ed.), International Joint Conference on Artificial Intelligence, IJCAI 2011. AAAI Press, Menlo Park, CA. To appear. Accepted for oral and poster presentation.
	Sergey Goncharov, Lutz Schröder (2011). A coinductive calculus for asynchronous side-effecting processes. In Olaf Owe, Martin Steffen, Jan Arne Telle (Eds.), Fundamentals of Computation Theory (FCT 2011), Vol. 6914, Lecture Notes in Computer Science. Springer. To appear.
	Sergey Goncharov, Lutz Schröder (2011). A Counterexample to Tensorability of Effects. In Andrea Corradini, Bartek Klin (Eds.), Algebra and Coalgebra in Computer Science (CALCO 2011), Lecture Notes in Computer Science. Springer. To appear.

2010     Back to top

	Glauber Cabral, Christian Maeder, Till Mossakowski, Lutz Schröder (2010). Creating a HasCASL library. In Jonathan Aldrich, Ricardo Massa (Eds.), 14th Brazilian Symposium on Programming Languages (SBLP 2010).
	Rajeev Gore, Clemens Kupke, Dirk Pattinson, Lutz Schröder (2010). Global Caching for Coalgebraic Description Logics. In Jürgen Giesl, Reiner Haehnle (Eds.), International Joint Conference on Automated Reasoning, IJCAR 2010, Vol. 6173, pp. 46–60, Lecture Notes in Computer Science. Springer.
	Daniel Hausmann, Lutz Schröder (2010). Optimizing Conditional Logic Reasoning within CoLoSS. In Thomas Bolander, Torben Braüner (Eds.), Methods for Modalities (M4M-6, 2009), Vol. 262, (p. 157-171 ). , Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam.
	Carsten Lutz, Lutz Schröder (2010). Probabilistic Description Logics for Subjective Uncertainty. In Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski (Eds.), Principles of Knowledge Representation and Reasoning (KR 2010), pp. 393–403. AAAI Press, Menlo Park, CA.
	Till Mossakowski, Lutz Schröder, Sergey Goncharov (2010). A Generic Complete Dynamic Logic for Reasoning about Purity and Effects. In Formal Aspects of Computing, 22 (3-4), pp. 363–384.
	Dirk Pattinson, Lutz Schröder (2010). Cut Elimination in Coalgebraic Logics. In Information and Computation, Vol. 208, pp. 1447–1468.
	Lutz Schröder, Dirk Pattinson (2010). Rank-1 modal logics are coalgebraic . In Journal of Logic and Computation, 20 (5), pp. 1113–1147. Extends (Schröder and Pattinson STACS 2007).
	Lutz Schröder, Dirk Pattinson (2010). Named Models in Coalgebraic Hybrid Logic. In Jean-Yves Marion, Thomas Schwentick (Eds.), 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Vol. 5, pp. 645–656, Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Center of Informatics, Dagstuhl, Germany.
	Lutz Schröder, Dirk Pattinson (2010). Coalgebraic correspondence theory. In Luke Ong (Ed.), Foundations of Software Science and Computation Structures (FoSSaCS 2010), Vol. 6014, pp. 328–342, Lecture Notes in Computer Science. Springer.
	Lutz Schröder, Dirk Pattinson, Daniel Hausmann (2010). Optimal Tableaux for Conditional Logics with Cautious Monotonicity. In Michael Wooldridge (Ed.), European Conference on Artificial Intelligence (ECAI 2010), Vol. 215, pp. 707–712, Frontiers in Artificial Intelligence and Applications. IOS Press.
	Lutz Schröder, Yde Venema (2010). Flat coalgebraic fixed point logics. In Paul Gastin, François Laroussinie (Eds.), 21st International Conference on Concurrency Theory, CONCUR 2010, Vol. 6269, pp. 524–538, Lecture Notes in Computer Science. Springer.

2009     Back to top

	Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder (2009). CoLoSS: The Coalgebraic Logic Satisfiability Solver (System Description). In Carlos Areces, Stephane Demri (Eds.), Methods for Modalities (M4M-5, 2007), Vol. 231, pp. 41–54, Electronic Notes in Theoretical Computer Science. Elsevier Science.
	Sergey Goncharov, Lutz Schröder, Till Mossakowski (2009). Kleene Monads: Handling Iteration in a Framework of Generic Effects. In Alexander Kurz, Andrzej Tarlecki (Eds.), Algebra and Coalgebra in Computer Science (CALCO 2009), Vol. 5728, pp. 18–33, Lecture Notes in Computer Science. Springer.
	Michael Kohlhase, Johannes Lemburg, Lutz Schröder, Ewaryst Schulz (2009). Formal Management of CAD/CAM Processes. In Ana Cavalcanti, Dennis Dams (Eds.), Formal Methods (FM 2009), Vol. 5850, pp. 223–238, Lecture Notes in Computer Science. Springer.
	Rob Myers, Dirk Pattinson, Lutz Schröder (2009). Coalgebraic Hybrid Logic. In Luca de Alfaro (Ed.), Foundations of Software Science and Computation Structures (FOSSACS 2009), Vol. 5504, pp. 137–151, Lecture Notes in Computer Science. Springer.
	Dirk Pattinson, Lutz Schröder (2009). Generic Modal Cut Elimination Applied to Conditional Logics. In Martin Giese, Arild Waaler (Eds.), Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009), Vol. 5607, pp. 280–294, Lecture Notes in Computer Science. Springer.
	Lutz Schröder, Dirk Pattinson (2009). PSPACE Bounds for Rank-1 Modal Logics. In ACM Transactions on Computational Logic, 10 (2:13), pp. 1–33.
	Lutz Schröder, Till Mossakowski (2009). HasCASL: Integrated Higher-Order Specification and Program Development. In Theoretical Computer Science, 410 (12-13), pp. 1217–1260.
	Lutz Schröder, Dirk Pattinson (2009). Strong completeness of coalgebraic modal logics. In Susanne Albers, Jean-Yves Marion (Eds.), 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), pp. 673–684, Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Center of Informatics, Dagstuhl, Germany.
	Lutz Schröder, Dirk Pattinson, Clemes Kupke (2009). Nominals for Everyone. In Craig Boutilier (Ed.), International Joint Conferences on Artificial Intelligence (IJCAI 2009), pp. 917–922. AAAI Press, Menlo Park, CA.

2008     Back to top

	Corina Cirstea, Alexander Kurz, Dirk Pattinson, Lutz Schröder, Yde Venema (2008). Modal logics are coalgebraic. In Samson Abramsky, Erol Gelenbe, Vladimiro Sassone (Eds.), Visions of Computer Science, BCS International Academic Research Conference (BCS 2008), pp. 129–140. British Computer Society.
	Till Mossakowski, Lutz Schröder, Sergey Goncharov (2008). A generic complete dynamic logic for reasoning about purity and effects. In J. Fiadeiro, P. Inverardi (Eds.), Fundamental Approaches to Software Engineering (FASE 2008), Vol. 4961, pp. 199–214, Lecture Notes in Computer Science. Springer.
	Dirk Pattinson, Lutz Schröder (2008). Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. In Roberto Amadio (Ed.), Foundations of Software Science and Computation Structures (FOSSACS 2008), Vol. 4962, pp. 66–80, Lecture Notes in Computer Science. Springer.
	Dirk Pattinson, Lutz Schröder (2008). Admissibility of Cut in Coalgebraic Logics. In J. Adamek, C. Kupke (Eds.), Coalgebraic Methods in Computer Science (CMCS 08), Vol. 203, pp. 221–241, Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam.
	Lutz Schröder (2008). Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. In Theoretical Computer Science, Vol. 390, pp. 230–247. Extends (Schröder 2005).
	Lutz Schröder (2008). Linearizability of Non-expansive Semigroup Actions on Metric Spaces. In Topology and its Applications, Vol. 155, pp. 1576–1579. Preliminary version appeared as DFKI Research Report RR-06-1, DFKI GmbH, Kaiserslautern, 2006.
	Lutz Schröder, Dirk Pattinson (2008). How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics. In Gerhard Brewka, Jerôme Lang (Eds.), Principles of Knowledge Representation and Reasoning (KR 2008), pp. 307–218. AAAI Press, Menlo Park, CA.
	Lutz Schröder, Dirk Pattinson (2008). Shallow models for non-iterative modal logics. In Andreas Dengel, Karsten Berns, Thomas Breuel, Frank Bomarius, Thomas Roth-Berghofer (Eds.), Advances in Artificial Intelligence (KI 2008), Vol. 5243, pp. 324–331, Lecture Notes in Artificial Intelligence. Springer. Full version available as e-print arXiv:0802.0116.
	Lutz Schröder (2008). Bootstrapping Inductive and Coinductive Types in HasCASL. In Logical Methods in Computer Science, 4 (4:17), pp. 1–27.

2007     Back to top

	Joseph Goguen, Till Mossakowski, Valeria De Paiva, Florian Rabe, Lutz Schröder (2007). An Institutional View on Categorical Logic. In Int J Software Informatics, 1 (1), pp. 129–152.
	Lutz Schröder (2007). A finite model construction for coalgebraic modal logic. In Journal of Logic and Algebraic Programming (FOSSACS 06 special issue), Vol. 73, pp. 97–110. Extends (Schröder 2006).
	Lutz Schröder, Dirk Pattinson (2007). Rank-1 Modal Logics are Coalgebraic. In Wolfgang Thomas, Pascal Weil (Eds.), International Symposium on Theoretical Aspects of Computer Science (STACS 07), Vol. 4393, pp. 573–585, Lecture Notes in Computer Science. Springer. Extended version available.
	Lutz Schröder (2007). Book review: L. M. G. Feijs and H. B. M. Jonkers, Formal Specification and Design, Cambridge University Press, 2005. The Computer Journal 50 (2007), pp. 129-130.
	Lutz Schröder, Till Mossakowski (2007). Coalgebraic Modal Logic in CoCASL. In José Luiz Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 18th International Workshop, WADT 2006, Vol. 4409, pp. 128–142, Lecture Notes in Computer Science. Springer.
	Lutz Schröder (2007). Bootstrapping Types and Cotypes in HasCASL. In Till Mossakowski, Udo Montanari (Eds.), Algebra and Coalgebra in Computer Science (CALCO 07), Vol. 4624, pp. 447–462, Lecture Notes in Computer Science. Springer. Extended version available.
	Lutz Schröder, Dirk Pattinson (2007). Modular Algorithms for Heterogeneous Modal Logics. In Lars Arge, Andrzej Tarlecki, Christian Cachin (Eds.), Automata, Languages and Programming (ICALP 07), Vol. 4596, pp. 459–471, Lecture Notes in Computer Science. Springer.
	Stefan Wölfl, Till Mossakowski, Lutz Schröder (2007). Qualitative Constraint Calculi: Heterogeneous Verification of Composition Tables. In David Wilson, Geoff Sutcliffe (Eds.), 20th International FLAIRS Conference (FLAIRS-20), pp. 665–670. AAAI Press.

2006     Back to top

	U. Frese, L. Schröder (2006). Closing a Million-Landmarks Loop. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing.
	Sergey Goncharov, Lutz Schröder, Till Mossakowski (2006). Completeness of Global Evaluation Logic. In Rastislav Kralovic, Pawel Urzyczyn (Eds.), Mathematical Foundations of Computer Science, Vol. 4162, pp. 447–458, Lecture Notes in Computer Science. Springer, Berlin.
	Daniel Hausmann, Till Mossakowski, Lutz Schröder (2006). A Coalgebraic Approach to the Semantics of the Ambient Calculus. In Theoretical Computer Science, 366 (1-2), pp. 121–143. Extends (Hausmann et al. 2005).
	Till Mossakowski, Lutz Schröder, Markus Roggenbach, Horst Reichel (2006). Algebraic-co-algebraic specification in CoCASL. In Journal of Logic and Algebraic Programming, 67 (1-2), pp. 146–197. Extends (Mossakowski et al. 2003).
	Till Mossakowski, Lutz Schröder, Stefan Wölfl (2006). A Categorical Perspective on Qualitative Constraint Calculi. In Stefan Wölfl, Till Mossakowski (Eds.), Qualitative Constraint Calculi - Application and Integration. Workshop at KI 2006, pp. 28–39.
	Lutz Schröder (2006). The HasCASL Prologue - Categorical Syntax and Semantics of the Partial λ-calculus. In Theoret. Comput. Sci., Vol. 353, pp. 1–25.
	Lutz Schröder (2006). A Finite Model Construction for Coalgebraic Modal Logic. In Luca Aceto, Anna Ingólfsdóttir (Eds.), Foundations Of Software Science And Computation Structures, Vol. 3921, pp. 157–171, Lecture Notes in Computer Science. Springer, Berlin. EATCS Best Paper Award at ETAPS 2006.
	Lutz Schröder, Dirk Pattinson (2006). PSPACE Bounds for Rank 1 Modal Logics. In Rajeev Alur (Ed.), Logic in Computer Science (LICS 06), pp. 231–240. IEEE. Presentation slides available.

2005     Back to top

	Daniel Hausmann, Till Mossakowski, Lutz Schröder (2005). Iterative Circular Coinduction for CoCASL in Isabelle/HOL. In Maura Cerioli (Ed.), Fundamental Approaches to Software Engineering 2005, Vol. 3442, pp. 341–356, Lecture Notes in Computer Science. Springer, Berlin.
	Daniel Hausmann, Till Mossakowski, Lutz Schröder (2005). Towards a Coalgebraic Approach to the Semantics of the Ambient Calculus. In Jose Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten (Eds.), Algebra and Coalgebra in Computer Science, Vol. 3629, pp. 232–246, Lecture Notes in Computer Science. Springer, Berlin.
	Christoph Lüth, Markus Roggenbach, Lutz Schröder (2005). CCC - The CASL Consistency Checker. In José Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Vol. 3423, pp. 94–105, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Piotr Hoffman, Bartek Klin (2005). Amalgamation in the semantics of CASL. In Theoretical Computer Science, 331 (1), pp. 215–247.
	Lutz Schröder, Till Mossakowski, Christoph Lüth (2005). Type class polymorphism in an institutional framework. In José Fiadeiro (Ed.), Recent Trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004), Vol. 3423, pp. 234–248, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder (2005). Expressivity of Coalgebraic Modal Logic: The Limits and Beyond. In Vladimiro Sassone (Ed.), Foundations of Software Science And Computation Structures, Vol. 3441, pp. 440–454, Lecture Notes in Computer Science. Springer, Berlin.
	Dennis Walter, Lutz Schröder, Till Mossakowski (2005). Parametrized Exceptions. In Jose Fiadeiro, Jan Rutten (Eds.), Algebra and Coalgebra in Computer Science, Vol. 3629, pp. 424–438, Lecture Notes in Computer Science. Springer, Berlin.

2004     Back to top

	Michael Megrelishvili, Lutz Schröder (2004). Globalization of Confluent Partial Actions on Topological and Metric Spaces. In Topology and Applications, Vol. 145, pp. 119–145.
	Markus Roggenbach, Lutz Schröder, Till Mossakowski (2004). Libraries. In Peter Mosses (Ed.), CASL reference manual, Vol. 2960, Lecture Notes in Computer Science. Springer, Berlin. Early version appeared as CoFI note L-12, http://www.informatik.uni-bremen.de/cofi/old/Notes/L-12/index.html.
	Lutz Schröder, Till Mossakowski (2004). Generic exception handling and the Java monad. In Charles Rattray, Savitri Maharaj, Carron Shankland (Eds.), Algebraic Methodology and Software Technology, Vol. 3116, pp. 443–459, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder, Till Mossakowski (2004). Monad-independent dynamic logic in HasCASL. In Journal of Logic and Computation, 14 (4), pp. 571–619. Earlier version appeared in Martin Wirsing, Dirk Pattinson, and Rolf Hennicker (eds.), Recent Trends in Algebraic Development Techniques, 16th International Workshop (WADT 2002), LNCS vol. 2755, Springer, Berlin, 2003, pp. 425-441.
	Lutz Schröder (2004). The logic of the partial λ-calculus with equality. In Jerzy Marcinkowski, Andrzej Tarlecki (Eds.), Computer Science Logic (CSL 04), Vol. 3210, pp. 385–399, Lecture Notes in Computer Science. Springer, Berlin.

2003     Back to top

	Till Mossakowski, Horst Reichel, Markus Roggenbach, Lutz Schröder (2003). Algebraic-co-algebraic specification in CoCASL. In Martin Wirsing, Dirk Pattinson, Rolf Hennicker (Eds.), Recent Developments in Algebraic Development Techniques, 16th International Workshop, WADT'02, Vol. 2755, pp. 376–392, Lecture Notes in Computer Science. Springer, Berlin.
	Till Mossakowski, Markus Roggenbach, Lutz Schröder (2003). CoCASL at work --- Modelling Process Algebra. In Hans-Peter Gumm (Ed.), Coalgebraic Methods in Computer Science, Vol. 82, Electronic Notes in Theoretical Computer Science. Elsevier Science.
	Lutz Schröder (2003). Classifying categories for partial equational logic. In Richard Blute (Ed.), Category Theory and Computer Science (CTCS 02), Vol. 69, Electronic Notes in Theoretical Computer Science. Elsevier Science.
	Lutz Schröder, Till Mossakowski (2003). Monad-independent Hoare logic in HasCASL. In Mauro Pezze (Ed.), Fundamental Approaches to Software Engineering (FASE 2003), Vol. 2621, pp. 261–277, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder (2003). Henkin models of the partial λ-calculus. In Matthias Baaz, Johann Makowsky (Eds.), Computer Science Logic, Vol. 2803, pp. 498–512, Lecture Notes in Computer Science. Springer, Berlin.
	L. Schröder, T. Mossakowski, C. Maeder (2003). HasCASL - Integrated functional specification and programming. Language summary..

2002     Back to top

	Lutz Schröder, Till Mossakowski (2002). HasCASL: towards integrated specification and development of functional programs. In Hélène Kirchner, Christophe Ringeissen (Eds.), Algebraic Methodology And Software Technology (AMAST 2002), Vol. 2422, pp. 99–116, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder (2002). Monads on composition graphs. In Applied Categorical Structures, Vol. 10, pp. 221–236.
	Lutz Schröder, Paulo Mateus (2002). Universal aspects of probabilistic automata. In Math. Struct. Comput. Sci., Vol. 12, pp. 481–512.

2001     Back to top

	Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski (2001). Checking amalgamability conditions for CASL architectural specifications. In Jiri Sgall, Ales Pultr, Petr Kolman (Eds.), Mathematical Foundations of Computer Science, Vol. 2136, pp. 512–523, Lecture Notes in Computer Science. Springer, Berlin.
	Markus Roggenbach, Lutz Schröder (2001). Towards Trustworthy Specifications I: Consistency Checks. In Maura Cerioli, Gianna Reggio (Eds.), Recent Trends in Algebraic Specification Techniques, 15th International Workshop, WADT 2001, Vol. 2267, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder (2001). Categories: a free tour. In Austin Melton, Jürgen Koslowski (Eds.), Categorical Perspectives, pp. 1–27. Birkhäuser, Basel.
	Lutz Schröder (2001). Traces of Epimorphism classes. In Quaestiones Mathematicae, Vol. 24, pp. 193–200.
	Lutz Schröder (2001). Life without the Terminal Type. In Laurent Fribourg (Ed.), Computer Science Logic, Vol. 2142, pp. 429–442, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder, Till Mossakowski, Piotr Hoffman, Bartek Klin, Andrzej Tarlecki (2001). Semantics of Architectural Specifications in CASL. In Heinrich Hußmann (Ed.), Fundamental Approaches to Software Engineering, Vol. 2029, pp. 253–268, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder, Till Mossakowski, Andrzej Tarlecki (2001). Amalgamation via enriched CASL signatures. In Fernando Orejas, Paul Spirakis, Jan van Leeuwen (Eds.), International Colloquium on Automata, Languages and Programming (ICALP 2001), Vol. 2076, pp. 993–1004, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder, Horst Herrlich (2001). Free factorizations. In Applied Categorical Structures, Vol. 9, pp. 571–593.

2000     Back to top

	Markus Roggenbach, Lutz Schröder, Till Mossakowski (2000). Specifying real numbers in CASL. In Christine Choppy, Didier Bert (Eds.), Recent Developments in Algebraic Development Techniques, 14th International Workshop, WADT'99, Vol. 1827, pp. 146–161, Lecture Notes in Computer Science. Springer, Berlin.
	Lutz Schröder (2000). Isomorphisms and splitting of idempotents in semicategories. In Cahiers de Topologie et Géométrie Différentielle catégoriques, Vol. 41, pp. 143–153.
	Lutz Schröder, Horst Herrlich (2000). Free adjunction of morphisms. In Applied Categorical Structures, Vol. 8, pp. 595–606.
	Lutz Schröder, Horst Herrlich (2000). Abstract initiality. In Commentationes Mathematicae Universitatis Carolinae, Vol. 41, pp. 575–583.

1999     Back to top

	Horst Herrlich, Lutz Schröder (1999). Composing special epimorphisms and retractions. In Cahiers de Topologie et Géométrie Différentielle catégoriques, Vol. 40, pp. 221–226.
	Lutz Schröder (1999). Composition graphs and free extensions of categories. Universität Bremen. PhD Thesis.
Show selected entries in BibTex Format