-
1
-
-
0003506569
-
-
Number 14 in CSLI Lecture Notes, Stanford: CSLI Publications
-
Aczel, P.: Non-Well-Founded Sets, Number 14 in CSLI Lecture Notes, Stanford: CSLI Publications, 1988.
-
(1988)
Non-well-founded Sets
-
-
Aczel, P.1
-
9
-
-
84947980041
-
Infinite objects in type theory
-
Types for Proofs and Programs (H. Barendregt, T. Nipkow, Eds.), Springer-Verlag, Berlin
-
Coquand, T.: Infinite Objects in Type Theory, in: Types for Proofs and Programs (H. Barendregt, T. Nipkow, Eds.), vol. 806 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994, 62-78.
-
(1994)
Lecture Notes in Computer Science
, vol.806
, pp. 62-78
-
-
Coquand, T.1
-
10
-
-
32144436471
-
Chasing bottoms: A case study in program verification in the presence of partial and infinite values
-
Proceedings of the 7th International Conference on Mathematics of Program Construction, Springer, Stirling, Scotland, July
-
Danielsson, N., Jansson, P.: Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values, in: Proceedings of the 7th International Conference on Mathematics of Program Construction, vol. 3125 of Lecture Notes in Computer Science, Springer, Stirling, Scotland, July 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.3125
-
-
Danielsson, N.1
Jansson, P.2
-
12
-
-
17144404454
-
-
Technical Report CS-R9104, CW1, Amsterdam, January
-
Fokkinga, M. M., Meijer, E.: Program Calculation Properties of Continuous Algebras, Technical Report CS-R9104, CW1, Amsterdam, January 1991, Available online at http://wwwhome.cs.utwente.nl/ ~fokkinga/#detail.0000003528.
-
(1991)
Program Calculation Properties of Continuous Algebras
-
-
Fokkinga, M.M.1
Meijer, E.2
-
13
-
-
0038049660
-
Algebras, coalgebras, monads and comonads
-
number 44.1 in Electronic Notes in Theoretical Computer Science, Elsevier Science, April
-
Ghani, N., Luth, C., de Marchi, F., Power, J.: Algebras, Coalgebras, Monads and Comonads, in: Proceedings of the 4th International Workshop on Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science, Elsevier Science, April 2001.
-
(2001)
Proceedings of the 4th International Workshop on Coalgebraic Methods in Computer Science
-
-
Ghani, N.1
Luth, C.2
De Marchi, F.3
Power, J.4
-
14
-
-
35048864529
-
Build, augment, destroy. Universally
-
LNCS 3302, Springer Verlag
-
Ghani, N., Uustalu, T., Vene, V.: Build, Augment, Destroy. Universally, Proceedings of Programming Languages and Systems: Second Asian Symposium, LNCS 3302, Springer Verlag, 2004.
-
(2004)
Proceedings of Programming Languages and Systems: Second Asian Symposium
-
-
Ghani, N.1
Uustalu, T.2
Vene, V.3
-
15
-
-
33645476734
-
Calculating functional programs
-
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, Springer-Verlag, January
-
Gibbons, J.: Calculating Functional Programs, in: Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, vol. 2297 of Lecture Notes in Computer Science, Springer-Verlag, January 2002, 148-203.
-
(2002)
Lecture Notes in Computer Science
, vol.2297
, pp. 148-203
-
-
Gibbons, J.1
-
16
-
-
0011699068
-
When is a function a fold or an unfold?
-
number 44.1 in Electronic Notes in Theoretical Computer Science, Elsevier Science, April
-
Gibbons, J., Hutton, G., Altenkirch, T.: When is a Function a Fold or an Unfold?, in: Proceedings of the 4th International Workshop on Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science, Elsevier Science, April 2001.
-
(2001)
Proceedings of the 4th International Workshop on Coalgebraic Methods in Computer Science
-
-
Gibbons, J.1
Hutton, G.2
Altenkirch, T.3
-
17
-
-
0031600906
-
The under-appreciated unfold
-
Baltimore, Maryland, September
-
Gibbons, J., Jones, G.: The Under-Appreciated Unfold, in: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, 273-279.
-
(1998)
Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming
, pp. 273-279
-
-
Gibbons, J.1
Jones, G.2
-
21
-
-
0035882587
-
The generic approximation lemma
-
August
-
Hutton, G., Gibbons, J.: The Generic Approximation Lemma, Information Processing Letters, 79(4), August 2001, 197-201.
-
(2001)
Information Processing Letters
, vol.79
, Issue.4
, pp. 197-201
-
-
Hutton, G.1
Gibbons, J.2
-
22
-
-
0000892681
-
A tutorial on (Co)algebras and (Co)induction
-
Jacobs, B., Rutten, J.: A Tutorial on (Co)Algebras and (Co)Induction, Bulletin of the European Association for Theoretical Computer Science, 62, 1997, 222-259.
-
(1997)
Bulletin of the European Association for Theoretical Computer Science
, vol.62
, pp. 222-259
-
-
Jacobs, B.1
Rutten, J.2
-
23
-
-
0038720294
-
Short cut fusion is correct
-
Johann, P.: Short Cut Fusion is Correct, Journal of Functional Programming, 13(4), 2003, 797-814.
-
(2003)
Journal of Functional Programming
, vol.13
, Issue.4
, pp. 797-814
-
-
Johann, P.1
-
24
-
-
4344567063
-
Relational reasoning about contexts
-
(A. Gordon, A. Pitts, Eds.), Cambridge University Press
-
Lassen, S.: Relational Reasoning About Contexts, in: Higher Order Operational Techniques in Semantics (A. Gordon, A. Pitts, Eds.), Cambridge University Press, 1998, 91-135.
-
(1998)
Higher Order Operational Techniques in Semantics
, pp. 91-135
-
-
Lassen, S.1
-
25
-
-
0025507960
-
Algebraic data types and program transformation
-
September
-
Malcolm, G.: Algebraic Data Types and Program Transformation, Science of Computer Programming, 14(2-3), September 1990, 255-280.
-
(1990)
Science of Computer Programming
, vol.14
, Issue.2-3
, pp. 255-280
-
-
Malcolm, G.1
-
26
-
-
0015655445
-
Inductive methods for proving properties of programs
-
August
-
Manna, Z., Ness, S., Vuillemin, J.: Inductive Methods for Proving Properties of Programs, Communications of the ACM, 16(8), August 1973, 491-502.
-
(1973)
Communications of the ACM
, vol.16
, Issue.8
, pp. 491-502
-
-
Manna, Z.1
Ness, S.2
Vuillemin, J.3
-
28
-
-
0009093311
-
On the foundations of corecursion
-
Moss, L., Danner, N.: On the Foundations of Corecursion, Logic Journal of the Interest Group in Pure and Applied Logics, 5(2), 1997, 231-257.
-
(1997)
Logic Journal of the Interest Group in Pure and Applied Logics
, vol.5
, Issue.2
, pp. 231-257
-
-
Moss, L.1
Danner, N.2
-
29
-
-
0014651649
-
Fixpoint induction and proofs of program properties
-
Park, D.: Fixpoint Induction and Proofs of Program Properties, Machine Intelligence, 5, 1969, 59-78.
-
(1969)
Machine Intelligence
, vol.5
, pp. 59-78
-
-
Park, D.1
-
30
-
-
0346801207
-
Mechanizing coinduction and corecursion in higher-order logic
-
Paulson, L.: Mechanizing Coinduction and Corecursion in Higher-Order Logic, Journal of Logic and Computation, 7, 1997, 175-204.
-
(1997)
Journal of Logic and Computation
, vol.7
, pp. 175-204
-
-
Paulson, L.1
-
31
-
-
33645478346
-
Guarded induction on final coalgebras
-
(B. Jacobs, L. Moss, H. Reichel, J. Rutten, Eds.), number 11 in Electronic Notes in Theoretical Computer Science, Elsevier
-
Pavlovic, D.: Guarded Induction on Final Coalgebras, in: Coalgebraic Methods in Computer Science (B. Jacobs, L. Moss, H. Reichel, J. Rutten, Eds.), number 11 in Electronic Notes in Theoretical Computer Science, Elsevier, 2000.
-
(2000)
Coalgebraic Methods in Computer Science
-
-
Pavlovic, D.1
-
33
-
-
0001233777
-
Parametric polymorphism and operational equivalence
-
Pitts, A. M.: Parametric Polymorphism and Operational Equivalence, Mathematical Structures in Computer Science, 10, 2000, 321-359.
-
(2000)
Mathematical Structures in Computer Science
, vol.10
, pp. 321-359
-
-
Pitts, A.M.1
-
35
-
-
0004664676
-
Computing with contexts: A simple approach
-
Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II) (A. D. Gordon, A. M. Pitts, C. L. Talcott, Eds.), Elsevier Science Publishers B.V.
-
Sands, D.: Computing with Contexts: A Simple Approach, in: Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II) (A. D. Gordon, A. M. Pitts, C. L. Talcott, Eds.), vol. 10 of Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers B.V., 1998.
-
(1998)
Electronic Notes in Theoretical Computer Science
, vol.10
-
-
Sands, D.1
-
36
-
-
0000560597
-
Improvement theory and its applications
-
(A. Gordon, A. Pitts, Eds.), Cambridge University Press
-
Sands, D.: Improvement Theory and Its Applications, in: Higher Order Operational Techniques in Semantics (A. Gordon, A. Pitts, Eds.), Cambridge University Press, 1998, 275-306.
-
(1998)
Higher Order Operational Techniques in Semantics
, pp. 275-306
-
-
Sands, D.1
-
39
-
-
0000874096
-
The category-theoretic solution of recursive domain equations
-
November
-
Smyth, M. B., Plotkin, G. D.: The Category-Theoretic Solution of Recursive Domain Equations, SIAM Journal on Computing, 11(4), November 1982, 761-783.
-
(1982)
SIAM Journal on Computing
, vol.11
, Issue.4
, pp. 761-783
-
-
Smyth, M.B.1
Plotkin, G.D.2
-
40
-
-
84949511823
-
Elementary strong functional programming
-
Proceedings of the First International Symposium on Functional Programming Languages in Education, Springer-Verlag
-
Turner, D. A.: Elementary Strong Functional Programming, in: Proceedings of the First International Symposium on Functional Programming Languages in Education, vol. 1022 of Lecture Notes in Computer Science, Springer-Verlag, 1995, 1-13.
-
(1995)
Lecture Notes in Computer Science
, vol.1022
, pp. 1-13
-
-
Turner, D.A.1
|