Programming interfaces and basic topology

Annals of Pure and Applied Logic

Volumn 137, Issue 1-3, 2006, Pages 189-239

  Hancock, Peter ^a   Hyvernat, Pierre ^b,c  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b AIX MARSEILLE UNIVERSITÉ   (France)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Constructive type theory; Formal topology; Predicate transformers; Simulation

Indexed keywords

EID: 27744433928     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.05.022     Document Type: Article

References (43)

1. Martín Abadi Leslie Lamport The existence of refinement mappings Theoretical Computer Science 82 2 Logic Semantics Theory Program. 1991 253-284
2. Peter Aczel An introduction to inductive definitions in: Jon Barwise (Ed.) Handbook of Mathematical Logic Studies in Logic and the Foundations of Mathematics vol. 90 1977 North-Holland Publishing Co. Amsterdam 739-782
3. Bowen Alpern Fred Barry Schneider Defining liveness Information Processing Letters 21 4 1985 181-185
4. Ralph-Johan Back Joakim von Wright Refinement calculus, A systematic introduction in: Graduate Texts in Computer Science 1998 Springer-Verlag New York
5. Ralph-Johan Back, Joakim von Wright, Products in the refinement calculus, Technical Report 235, Turku Center for Computer Science, February 1999
6. Ralph-Johan Back Joakim Von Wright Encoding, decoding and data refinement Formal Aspects of Computing 12 5 2000 313-349
7. Thierry Coquand A semantics of evidence for classical arithmetic The Journal of Symbolic Logic 60 1 1995 325-337
8. Thierry Coquand Catarina Coquand The Agda proof assistant http://www.cs.chalmers.se/~catarina/agda/ 2000
9. Thierry Coquand Giovanni Sambin Jan Smith Silvio Valentini Inductively generated formal topologies Annals of Pure and Applied Logic 124 1-3 2003 71-106
10. Edsger Wybe Dijkstra A Discipline of Programming 1976 Prentice-Hall
11. Albert Grigorevich Drágalin A completeness theorem for intuitionistic predicate logic. An intuitionistic proof Publicationes Mathematicae Debrecen 34 1-2 1987 1-19
12. Robert W. Floyd Assigning meaning to programs in: Jacob T. Schwartz (Ed.) Mathematical Aspects of Computer Science: Proc. American Mathematics Soc. Symposia vol. 19 1967 American Mathematical Society Providence RI 19-31
13. Paul H.B. Gardiner Carroll Morgan A single complete rule for data refinement Formal Aspects of Computing 5 4 1993 367-382
14. Silvia Gebellato, Giovanni Sambin, The essence of continuity (the Basic Picture, II), Preprint no. 27, Dipartimiento di matematica, Universit̀ di Padova, 2001
15. Silvia Gebellato, Giovanni Sambin, Pointfree continuity and convergence (the Basic Picture, IV), 2002. draft
16. Andrzej Grzegorczyk A philosophically plausible formal interpretation of intuitionistic logic Indagationes Mathematicae, Koninklijke Nederlandse Akadademie van Wetenschappen, Proceedings Series A 67 26 1964 596-601
17. Peter Hancock Anton Setzer Interactive programs in dependent type theory in: Computer Science Logic (Fischbachau, 2000) Lecture Notes in Comput. Sci. vol. 1862 2000 Springer Berlin 317-331
18. Peter Hancock, Anton Setzer, Specifying interactions with dependent types, in: Workshop on Subtyping and Dependent Types in Programming, Portugal, 7th July 2000, 2000
19. Peter Hancock Anton Setzer Guarded induction and weakly final coalgebras in dependent type theory in: L. Crosilla P. Schuster (Eds.) From Sets and Types to Topology and Analysis; Towards Practicable Foundations for Constructive Mathematics 2005 Oxford University Press
20. Charles Anthony Richard Hoare An axiomatic basis for computer programming Communications of the ACM 12 10 1969 576-580
21. Martin Hofmann Elimination of extensionality and quotient types in Martin-Löf's type theory in: Types for Proofs and Programs, International Workshop TYPES'93 LNCS vol. 806 1994 Springer Verlag
22. Pierre Hyvernat, Predicate transformers and linear logic: Second order, Unpublished. http://iml.univ-mrs.fr/~hyvernat/academics.html, 2004
23. Pierre Hyvernat Predicate transformers and linear logic: Yet another denotational model in: Jerzy Marcinkowski Andrzej Tarlecki (Eds.) 18th International Workshop CSL 2004 September 2004 Lecture Notes in Computer Science vol. 3210 2004 Springer-Verlag 115-129
24. Peter T. Johnstone The point of pointless topology Bulletin of the American Mathematical Society 8 1 1983 41-53
25. Leslie Lamport Proving the correctness of multiprocess programs IEEE Transactions on Software Engineering 3 2 1977 125-143
26. Leslie Lamport Formal foundation for specification and verification in: Alford et al. (Eds.) Distributed Systems: Methods and Tools for Specification Lecture Notes in Computer Science number 190 1985 Springer-Verlag Berlin
27. Leslie Lamport Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers 2002 Addison-Wesley
28. Per Martin-Löf Intuitionistic Type Theory, Bibliopolis, Naples 1984 Notes by Giovanni Sambin
29. Markus Michelbrink Anton Setzer State-dependent IO-monads in type theory Electronic Notes in Theoretical Computer Science 122 2005 127-146
30. John C. Mitchell Gordon D. Plotkin Abstract types have existential type ACM Transactions on Program Language Systems 10 3 1988 470-502
31. Bengt Nordström Kent Petersson Jan Magnus Smith Programming in Martin-Löf's Type Theory, An Introduction 1990 The Clarendon Press, Oxford University Press New York
32. Kent Petersson Dan Synek A set constructor for inductive sets in Martin-Löf's type theory in: Proceedings of the 1989 Conference on Category Theory and Computer Science Manchester, UK LNCS vol. 389 1989 Springer Verlag
33. Giovanni Sambin Intuitionistic formal spaces-a first communication in: Mathematical Logic and its Applications (Druzhba, 1986) 1987 Plenum New York 187-204
34. Giovanni Sambin, The Basic Picture, a structure for topology (the Basic Picture, I), Preprint no. 26, Dipartimiento di matematica, Universit̀ di Padova, 2001
35. Giovanni Sambin, Basic topologies, formal topologies, formal spaces (the Basic Picture, III), 2002. draft
36. Giovanni Sambin Some points in formal topology Theoretical Computer Science 305 1-3 2003 347-408
37. Giovanni Sambin Topology in Computer Science (SchloßDagstuhl, 2000).
38. Giovanni Sambin Silvia Gebellato A preview of the basic picture: A new perspective on formal topology in: Types for Proofs and Programs (Irsee, 1998) 1999 Springer Berlin 194-207
39. Giovanni Sambin Silvio Valentini Building up a toolbox for Martin-Löf's type theory: Subset theory in: Twenty-five years of constructive type theory (Venice, 1995) 1998 Oxford Univ. Press New York 221-244
40. Fred Barry Schneider Implementing fault-tolerant services using the state machine approach: A tutorial ACM Computing Surveys 22 4 1990 299-319
41. Alfred Tarski Fundamentale Begriffe der Methodologie der deduktiven Wissenschaften. I Monatshefte für Mathematik und Physik 37 1930 361-404
42. Silvio Valentini The problem of the formalization of constructive topology Archive for Mathematical Logic 44 1 2005 115-129
43. Steven Vickers Topology via logic Cambridge Tracts in Theoretical Computer Science vol. 5 1989 Cambridge University Press Cambridge