-
1
-
-
85031207926
-
Recursive coalgebras of finitary functors
-
P. Mosses, J. Power, M. Seisenberger Eds., Department of Computer Science, University of Wales Swansea
-
J. Adámek, D. Lücke, S. Milius, Recursive coalgebras of finitary functors, in: P. Mosses, J. Power, M. Seisenberger (Eds.), Selected Papers from the CALCO 2005 Young Researchers Workshop, CALCO-jnr 2005 (Swansea, September 2005), Tech. Report CSR 18-2005, Department of Computer Science, University of Wales Swansea, 2005, pp. 1-14.
-
(2005)
Selected Papers from the CALCO 2005 Young Researchers Workshop, CALCO-jnr 2005 (Swansea, September 2005), Tech. Report CSR 18-2005
, pp. 1-14
-
-
Adámek, J.1
Lücke, D.2
Milius, S.3
-
2
-
-
0038753013
-
Infinite trees and completely iterative theories: A coalgebraic view
-
P. Aczel, J. Adámek, S. Milius, J. Velebil, Infinite trees and completely iterative theories: a coalgebraic view, Theoret. Comput. Sci. 300 (1-3) (2003) 1-45.
-
(2003)
Theoret. Comput. Sci.
, vol.300
, Issue.1-3
, pp. 1-45
-
-
Aczel, P.1
Adámek, J.2
Milius, S.3
Velebil, J.4
-
3
-
-
70350703672
-
Free iterative theories: A coalgebraic view
-
DOI 10.1017/S0960129502003924, Coalgebraic Methods in Computer Science
-
J. Adámek, S. Milius, J. Velebil, Free iterative theories: A coalgebraic view, Math. Struct. Comput. Sci. 13(2) (2003) 259-320. (Pubitemid 36434770)
-
(2003)
Mathematical Structures in Computer Science
, vol.13
, Issue.2
, pp. 259-320
-
-
Adamek, J.1
Milius, S.2
Velebil, J.3
-
4
-
-
10444235086
-
From iterative algebras to iterative theories (extended abstract)
-
DOI 10.1016/j.entcs.2004.02.033, PII S1571066104051679
-
J. Adámek, S. Milius, J. Velebil, From iterative algebras to iterative theories (extended abstract), in: J. Adámek, S. Milius (Eds.), Proceedings of the 7th Workshop on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, March 2004), Electron. Notes in Theoret. Comput. Sci., vol. 106, Elsevier, Amsterdam, 2004, pp. 3-24. (Pubitemid 40536116)
-
(2004)
Electronic Notes in Theoretical Computer Science
, vol.106
, Issue.1-4 SPEC. ISS.
, pp. 3-24
-
-
Adamek, J.1
Milius, S.2
Velebil, J.3
-
5
-
-
85014768337
-
Generalised coinduction
-
DOI 10.1017/S0960129502003900, Coalgebraic Methods in Computer Science
-
F. Bartels, Generalised coinduction, Math. Struct. Comput. Sci. 13(2) (2003) 321-348. (Pubitemid 36434771)
-
(2003)
Mathematical Structures in Computer Science
, vol.13
, Issue.2
, pp. 321-348
-
-
Bartels, F.1
-
6
-
-
84949501091
-
Nested general recursion and partiality in type theory
-
Theorem Proving in Higher Order Logics
-
A. Bove, V. Capretta, Nested general recursion and partiality in type theory, in: R. J. Boulton, P. B. Jackson (Eds.), Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2001 (Edinburgh, September 2001), Lecture Notes in Comput. Sci., vol. 2152, Springer-Verlag, Berlin, 2001, pp. 121-135. (Pubitemid 33328996)
-
(2001)
Lecture Notes in Computer Science
, Issue.2152
, pp. 121-135
-
-
Bove, A.1
Capretta, V.2
-
7
-
-
33646127648
-
Modelling general recursion in type theory
-
A. Bove, V. Capretta, Modelling general recursion in type theory, Math. Struct. Comput. Sci. 15(4) (2005) 671-708.
-
(2005)
Math. Struct. Comput. Sci.
, vol.15
, Issue.4
, pp. 671-708
-
-
Bove, A.1
Capretta, V.2
-
8
-
-
0942291420
-
Generalized coiteration schemata
-
H. P. Gumm Ed., Electron. Notes in Theoret. Comput. Sci., Elsevier, Amsterdam, Warsaw, Apr. 2003
-
D. Cancila, F. Honsell, M. Lenisa, Generalized coiteration schemata, in: H. P. Gumm (Ed.), Proceedings of the 6th Workshop on Coalgebraic Methods in Computer Science, CMCS'03 (Warsaw, Apr. 2003), vol. 82, No. 1, Electron. Notes in Theoret. Comput. Sci., Elsevier, Amsterdam, 2003.
-
(2003)
Proceedings of the 6th Workshop on Coalgebraic Methods in Computer Science, CMCS'03
, vol.82
, Issue.1
-
-
Cancila, D.1
Honsell, F.2
Lenisa, M.3
-
9
-
-
0003797989
-
-
Department of Computer Science, University of Calgary
-
R. Cockett, T. Fukushima, About Charity, Yellow Series Report 92/480/18, Department of Computer Science, University of Calgary, 1992.
-
(1992)
About Charity, Yellow Series Report 92/480/18
-
-
Cockett, R.1
Fukushima, T.2
-
11
-
-
0004020786
-
Coalgebra-to-algebra morphisms
-
M. Hofmann, G. Rosolini, D. Pavlović Eds., Elsevier, Amsterdam
-
A. Eppendahl, Coalgebra-to-algebra morphisms, in: M. Hofmann, G. Rosolini, D. Pavlović (Eds.), Proceedings of the 8th International Conference on Category Theory and Computer Science, CTCS'99 (Edinburgh, September 1999), Electron. Notes in Theoret. Comput. Sci., vol. 29, Elsevier, Amsterdam, 1999.
-
(1999)
Proceedings of the 8th International Conference on Category Theory and Computer Science, CTCS'99 (Edinburgh, September 1999), Electron. Notes in Theoret. Comput. Sci.
, vol.29
-
-
Eppendahl, A.1
-
13
-
-
0034863996
-
A universal characterization of the closed euclidean interval
-
IEEE Computer Society Press, Los Alamitos, CA, Boston, June 2001
-
M. Escardó, A. K. Simpson, A universal characterization of the closed euclidean interval, in: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS'01 (Boston, June 2001), IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 115-128.
-
(2001)
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS'01
, pp. 115-128
-
-
Escardó, M.1
Simpson, A.K.2
-
14
-
-
0001817272
-
Algebraically complete categories
-
A. Carboni, M. C. Pedicchio, G. Rosolini Eds., Lecture Notes in Mathematics, Springer-Verlag, Berlin, Como, July 1990
-
P. J Freyd, Algebraically complete categories, in: A. Carboni, M. C. Pedicchio, G. Rosolini (Eds.), Proceedings of the International Conference on Category Theory'90, CT'90 (Como, July 1990), Lecture Notes in Mathematics, vol. 1488, Springer-Verlag, Berlin, 1991, pp. 95-104.
-
(1991)
Proceedings of the International Conference on Category Theory'90, CT'90
, vol.1488
, pp. 95-104
-
-
Freyd, P.J.1
-
15
-
-
0003543289
-
-
PhD thesis, Department of Informatics, University of Twente
-
M. M. Fokkinga, Law and Order in Algorithmics, PhD thesis, Department of Informatics, University of Twente, 1992.
-
(1992)
Law and Order in Algorithmics
-
-
Fokkinga, M.M.1
-
16
-
-
0025683783
-
Recursive types reduced to inductive types
-
IEEE Computer Society Press, Los Alamitos, CA, Philadelphia, PA, June 1990
-
P. J. Freyd, Recursive types reduced to inductive types, in: Proceedings of the 5th IEEE Annual Symposium on Logic in Computer Science, LICS'90 (Philadelphia, PA, June 1990), IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 498-507.
-
(1990)
Proceedings of the 5th IEEE Annual Symposium on Logic in Computer Science, LICS'90
, pp. 498-507
-
-
Freyd, P.J.1
-
17
-
-
0001817274
-
Remarks on algebraically compact categories
-
M. P. Fourman, P. T. Johnstone, A. M. Pitts Eds., Cambridge University Press, Cambridge
-
P. J. Freyd, Remarks on algebraically compact categories, in: M. P. Fourman, P. T. Johnstone, A. M. Pitts (Eds.), Applications of Categories in Computer Science, LMS Lecture Note Series, vol. 177, Cambridge University Press, Cambridge, 1992, pp. 95-106.
-
(1992)
Applications of Categories in Computer Science, LMS Lecture Note Series
, vol.177
, pp. 95-106
-
-
Freyd, P.J.1
-
18
-
-
84948168202
-
Codifying guarded definitions with recursion schemes
-
P. Dybjer, B. Nördstrom Eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, Båstad, June 1994
-
E. Giménez, Codifying guarded definitions with recursion schemes, in: P. Dybjer, B. Nördstrom (Eds.), Selected Papers from 2nd International Workshop on Types for Proofs and Programs, TYPES'94 (Båstad, June 1994), Lecture Notes in Computer Science, vol. 996, Springer-Verlag, Berlin, 1995, pp. 39-59.
-
(1995)
Selected Papers from 2nd International Workshop on Types for Proofs and Programs, TYPES'94
, vol.996
, pp. 39-59
-
-
Giménez, E.1
-
19
-
-
84878591537
-
Structural recursive definitions in type theory
-
Automata, Languages and Programming
-
E. Giménez, Structural recursive definitions in type theory, in: K. G. Larsen, S. Skyum, G. Winskel (Eds.), Proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98 (Aalborg, July 1998), Lecture Notes in Computer Science, vol. 1443, Springer-Verlag, Berlin, 1998, pp. 397-408. (Pubitemid 128111132)
-
(1998)
Lecture Notes in Computer Science
, Issue.1443
, pp. 397-408
-
-
Gimenez, E.1
-
20
-
-
85034647614
-
A typed lambda calculus with categorical type constructors
-
D. H. Pitt, A. Poigné, D. E. Rydeheard Eds., Lecture Notes in Computer Science, Springer-Velrag, Berlin, Edinburgh, September 1987
-
T. Hagino, A typed lambda calculus with categorical type constructors, in: D. H. Pitt, A. Poigné, D. E. Rydeheard (Eds.), Proceedings of the 2nd International Conference on Category Theory and Computer Science, CTCS'87 (Edinburgh, September 1987), Lecture Notes in Computer Science, vol. 283, Springer-Velrag, Berlin, 1987, pp. 140-157.
-
(1987)
Proceedings of the 2nd International Conference on Category Theory and Computer Science, CTCS'87
, vol.283
, pp. 140-157
-
-
Hagino, T.1
-
21
-
-
17444402906
-
Relating two approaches to coinductive solution of recursive equations
-
DOI 10.1016/j.entcs.2004.02.032, PII S1571066104051734
-
B. Jacobs, Relating two approaches to coinductive solution of recursive equations, in: J. Adámek, S. Milius (Eds.), Proceedings of the 7th Workshop on Coalgebraic Methods in Computer Science, CMCS'04 (Barcelona, March 2004), Electron. Notes in Theoret. Comput. Sci., vol. 106, Elsevier, Amsterdam, 2004, pp. 145-166. (Pubitemid 40536123)
-
(2004)
Electronic Notes in Theoretical Computer Science
, vol.106
, Issue.1-4 SPEC. ISS.
, pp. 145-166
-
-
Jacobs, B.1
-
22
-
-
0001063647
-
A fixpoint theorem for complete categories
-
J. Lambek, A fixpoint theorem for complete categories, Math. Z. 103(1968) 151-161.
-
(1968)
Math. Z.
, vol.103
, pp. 151-161
-
-
Lambek, J.1
-
23
-
-
0025507960
-
Data structures and program transformation
-
G. Malcolm, Data structures and program transformation, Sci. Comput. Program. 14 (2-3) (1990) 255-279.
-
(1990)
Sci. Comput. Program.
, vol.14
, Issue.2-3
, pp. 255-279
-
-
Malcolm, G.1
-
24
-
-
0842289692
-
The view from the left
-
DOI 10.1017/S0956796803004829, Dependent Type Theory meets Practical Programming
-
C. McBride, J. McKinna, The view from the left, J. Funct. Prog. 14(1) (2004) 69-111. (Pubitemid 38172187)
-
(2004)
Journal of Functional Programming
, vol.14
, Issue.1
, pp. 69-111
-
-
McBride, C.1
McKinna, J.2
-
25
-
-
33646050060
-
Epigram: Practical programming with dependent types
-
V. Vene, T. Uustalu Eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, Tartu, Aug. 2004
-
C. McBride, Epigram: practical programming with dependent types, in: V. Vene, T. Uustalu (Eds.), Revised Lectures from the 5th International School on Advanced Functional Programming, AFP 2004 (Tartu, Aug. 2004), Lecture Notes in Computer Science, vol. 3622, Springer-Verlag, Berlin, 2005, pp. 130-170.
-
(2005)
Revised Lectures from the 5th International School on Advanced Functional Programming, AFP 2004
, vol.3622
, pp. 130-170
-
-
McBride, C.1
-
26
-
-
85014115727
-
Functional programming with bananas, lenses, envelopes and barbed wire
-
J. Hughes Ed., Springer-Verlag, Berlin, Cambridge, MA, Aug. 1991, Lecture Notes in Computer Science
-
E. Meijer, M. Fokkinga, R. Paterson, Functional programming with bananas, lenses, envelopes and barbed wire, in: J. Hughes (Ed.), Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91 (Cambridge, MA, Aug. 1991), Lecture Notes in Computer Science, vol. 523, Springer-Verlag, Berlin, 1991, pp. 124-144.
-
(1991)
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91
, vol.523
, pp. 124-144
-
-
Meijer, E.1
Fokkinga, M.2
Paterson, R.3
-
27
-
-
10644296224
-
Completely iterative algebras and completely iterative monads
-
S. Milius, Completely iterative algebras and completely iterative monads, Inform. Comput. 196(1) (2005) 1-41.
-
(2005)
Inform. Comput.
, vol.196
, Issue.1
, pp. 1-41
-
-
Milius, S.1
-
28
-
-
0034914487
-
Parametric corecursion
-
DOI 10.1016/S0304-3975(00)00126-2, PII S0304397500001262
-
L. S. Moss, Parametric corecursion, Theoret. Comput. Sci. 260 (1-2) (2001) 139-163. (Pubitemid 32674015)
-
(2001)
Theoretical Computer Science
, vol.260
, Issue.1-2
, pp. 139-163
-
-
Moss, L.S.1
-
29
-
-
0013279465
-
Iterative algebras
-
E. Nelson, Iterative algebras, Theoret. Comput. Sci. 25(1983) 67-94.
-
(1983)
Theoret. Comput. Sci.
, vol.25
, pp. 67-94
-
-
Nelson, E.1
-
30
-
-
0039802561
-
Categorical set theory: A characterisation of the category of sets
-
G. Osius, Categorical set theory: A characterisation of the category of sets, J. Pure Appl. Algebra 4(1974) 79-119.
-
(1974)
J. Pure Appl. Algebra
, vol.4
, pp. 79-119
-
-
Osius, G.1
-
31
-
-
0030516228
-
Intuitionistic sets and ordinals
-
P. Taylor, Intuitionistic sets and ordinals, J. Symb. Logic 61(3) (1996) 705-744.
-
(1996)
J. Symb. Logic
, vol.61
, Issue.3
, pp. 705-744
-
-
Taylor, P.1
-
34
-
-
0030684322
-
Towards a mathematical operational semantics
-
IEEE Computer Science Press, Los Alamitos, CA, Warsaw, June/July 1997
-
D. Turi, G. D. Plotkin, Towards a mathematical operational semantics, in: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, LICS'97 (Warsaw, June/July 1997), IEEE Computer Science Press, Los Alamitos, CA, 1997, pp. 280-291.
-
(1997)
Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, LICS'97
, pp. 280-291
-
-
Turi, D.1
Plotkin, G.D.2
-
35
-
-
84949511823
-
Elementary strong functional programming
-
P. H. Hartel, R. Plasmeijer Eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, Nijmegen, December 1995
-
D. A. Turner, Elementary strong functional programming, in: P. H. Hartel, R. Plasmeijer (Eds.), Proceedings of the 1st International Symposium on Functional Programming Language in Education, FPLE'95 (Nijmegen, December 1995), Lecture Notes in Computer Science, vol. 1022, Springer-Verlag, Berlin, 1995, pp. 1-13.
-
(1995)
Proceedings of the 1st International Symposium on Functional Programming Language in Education, FPLE'95
, vol.1022
, pp. 1-13
-
-
Turner, D.A.1
-
36
-
-
0006903554
-
Primitive (co) recursion and course-of-value (co) iteration, categorically
-
T. Uustalu, V. Vene, Primitive (co) recursion and course-of-value (co) iteration, categorically, Informatica 10(1) (1999) 5-26.
-
(1999)
Informatica
, vol.10
, Issue.1
, pp. 5-26
-
-
Uustalu, T.1
Vene, V.2
-
37
-
-
0006983673
-
Coding recursion à la Mendler (extended abstract)
-
J. Jeuring Ed., Department of Computer Science, Utrecht University, Ponte de Lima, July 2000, Tech. Report UU-CS-2000-19
-
T. Uustalu, V. Vene, Coding recursion à la Mendler (extended abstract), in: J. Jeuring (Ed.), Proceedings of the 2nd Workshop on Generic Programming, WGP'2000 (Ponte de Lima, July 2000), Tech. Report UU-CS-2000-19, Department of Computer Science, Utrecht University, 2000, pp. 69-85.
-
(2000)
Proceedings of the 2nd Workshop on Generic Programming, WGP'2000
, pp. 69-85
-
-
Uustalu, T.1
Vene, V.2
-
38
-
-
0942291413
-
The dual of substitution is redecoration
-
K. Hammond, S. Curtis Eds., Intellect, Bristol/Portland, OR
-
T. Uustalu, V. Vene, The dual of substitution is redecoration, in: K. Hammond, S. Curtis (Eds.), Trends in Functional Programming, vol. 3, Intellect, Bristol/Portland, OR 2002, pp. 99-110.
-
(2002)
Trends in Functional Programming
, vol.3
, pp. 99-110
-
-
Uustalu, T.1
Vene, V.2
-
39
-
-
0942291416
-
Recursion schemes from comonads
-
T. Uustalu, V. Vene, A. Pardo, Recursion schemes from comonads, Nordic J. Comput. 8(3) (2001) 366-390.
-
(2001)
Nordic J. Comput.
, vol.8
, Issue.3
, pp. 366-390
-
-
Uustalu, T.1
Vene, V.2
Pardo, A.3
|