CiteSeer.IST Home   Related articles for: 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.   Doc

Related documents from co-citation:   All related documents
2:   A lightweight implementation of generics and dynamics - Cheney, Hinze - 2002
2:   Calculating functional programs - Gibbons - 2000
2:   International Series in Computer Science (context) - Bird, De Moor et al. - 1996
2:   When is a function a fold or an unfold (context) - Gibbons, Hutton et al. - 2001
2:   Introduction to Functional Programming (context) - Bird, Wadler - 1988
2:   Haskell 98 Language and Libraries: The Revised Report (context) - Jones - 2003
1:   Views: A Way for Pattern Matching to Cohabit with Data Abstraction - Wadler - 1987
1:   Functional Polytypic Programming (context) - Jansson - 2000
1:   Type-directed partial evaluation - Danvy
1:   Mathematical Structures in Computer Science (context) - Pitts, operational - 2000
1:   abstraction and parametric polymorphism (context) - Reynolds - 1983
1:   Dependency-style generic haskell - Loh, Clarke et al. - 2003
1:   Higher-Order Functions Considered Unnecessary for Higher-Order Programming - Goguen - 1990
1:   Partial abstract types (context) - Broy, Wirsing - 1982
1:   Computability: An Introduction to Recursive Function Theory (context) - Cutland - 1980
1:   Programming with abstract data types (context) - Berger - 2001
1:   Security by typing (context) - Debbabi, Durgin et al. - 2003
1:   Active patterns - Erwig - 1996
1:   Type theories and object-oriented programmimg (context) - Danforth, Tomlinson - 1988
1:   Special Issue on Program Transformation (context) - Gibbons, Hutton et al. - 2005

CiteSeer.IST - Copyright Penn State and NEC