default search action
FICS 2002: Copenhagen, Denmark
- Zoltán Ésik, Anna Ingólfsdóttir:
Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings. BRICS Notes Series NS-02-2, University of Aarhus 2002 - Glynn Winskel:
Calculus for categories. FICS 2002: 1 - Jirí Adámek, Stefan Milius, Jirí Velebil:
Parametric corecursion and completely iterative monads. FICS 2002: 2-5 - Neil Ghani, Christoph Lüth, Federico De Marchi:
Coalgebraic approaches to algebraic terms. FICS 2002: 6-8 - Tarmo Uustalu:
Generalizing substitution. FICS 2002: 9-11 - Nick Benton, Martin Hyland:
Traced pre-monoidal categories. FICS 2002: 12-19 - Luca Aceto:
Kleene through the process algebraic glass. FICS 2002: 20-21 - Christoph Sprenger, Mads Dam:
A note on global induction in a mu-calculus with explicit approximations. FICS 2002: 22-24 - Nikolay V. Shilov, Natalya Olegovna Garanina:
Model checking knowledge and fixpoints. FICS 2002: 25-39 - Benet Devereux:
Strong next-time operators for multiple-valued mu-calculus. FICS 2002: 40-43 - Dexter Kozen:
On two letters versus three. FICS 2002: 44-50 - Hans Leiß:
Kleenean semimodules and linear languages. FICS 2002: 51-53 - Guo-Qiang Zhang:
Decidable fragments of domain mu-calculus: an automata-theoretic perspective. FICS 2002: 54-57 - Margarita V. Korovina:
Fixed points on abstract structures without the equality test. FICS 2002: 58-60 - Gérard Boudol, Pascal Zimmer:
Recursion in the call-by-value lambda-calculus. FICS 2002: 61-66 - Anna Labella:
Kleene's (unary) star in nondeterministic context. FICS 2002: 67-68 - Thomas P. Jensen, Florimond Ployette, Olivier Ridoux:
Iteration schemes for fixed point calculation. FICS 2002: 69-76 - Luigi Santocanale:
Congruences of modal µ-algebras. FICS 2002: 77-81
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.