Joseph A. Goguen Programming Research Group, Oxford University SRI...  Home/Search
Context Related
| ucsd.edu/users/goguen/pubs/...tpasth.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/users/goguen/pubs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: There are many notions of type in computing. The most classical notion is "types as sets", which has been extended to cover many features of modern programming languages. This paper shows that such features are handled perhaps even more naturally by an extension of the "types as algebras" notion to a "types as theories" notion. This notion naturally supports object oriented concepts, including inheritance and local state, as well as generic modules and dependent types. Moreover, it explains why ... (Update)
Cited by: More
Conditional Circular Coinductive Rewriting with Case Analysis - Goguen, Lin, Rosu (2002) (Correct)
Behavioral Abstraction is Hiding Information - Rosu (2004) (Correct)
Inductive Behavioral Proofs by Unhiding - Rosu (2003) (Correct)
Active bibliography (related documents): More All
0.7: Tossing Algebraic Flowers down the Great Divide - Goguen (1999) (Correct)
0.7: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.7: Introducing OBJ - Goguen, Winkler, Meseguer.. (1993) (Correct)
Similar documents based on text: More All
0.2: HYPERPROGRAMMING: A Formal Approach to Software Environments - Goguen (1990) (Correct)
0.2: Higher Order Functions Considered Unnecessary for Higher Order.. - Goguen (1990) (Correct)
0.2: Proving Correctness Of Refinement And Implementation - Malcolm, Goguen (1996) (Correct)
Related documents from co-citation: More All
17: Theoretical Computer Science (context) - Goguen, Malcolm et al. - 1999
16: Towards an algebraic semantics for the object paradigm - Goguen, Diaconescu - 1994
15: Hiding more of hidden algebra - Goguen, Ro - 1999
BibTeX entry: (Update)
Joseph A. Goguen. Types as theories. In Topology and category theory in computer science, pages 357--390. Oxford science publications, 1991. http://citeseer.ist.psu.edu/503432.html More
@incollection{ goguen91types,
author = "Joseph Goguen",
title = "Types as Theories",
booktitle = "Topology and Category Theory in Computer Science",
publisher = "Oxford",
editor = "George Michael Reed and Andrew William Roscoe and Ralph F. Wachter",
pages = "357--390",
year = "1991",
url = "citeseer.ist.psu.edu/503432.html" }
Citations (may not include all citations):1274 Object-Oriented Software Construction (context) - Meyer - 1988
809 A theory of type polymorphism in programming (context) - Milner - 1978
562 Categories for the Working Mathematician (context) - Lane - 1971
333 Introduction to Functional Programming (context) - Bird, Wadler - 1988
325 Towards a theory of type structure (context) - Reynolds - 1974
265 Proof of correctness of data representation (context) - Hoare - 1972
258 Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
234 Institutions: Abstract model theory for specification and pr.. (context) - Goguen, Burstall
218 The mechanical evaluation of expressions (context) - Landin - 1964
214 An ideal model for recursive polymorphic types (context) - MacQueen, Sethi et al. - 1984
204 Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
173 Order-sorted algebra I: Equational deduction for multiple in.. - Goguen, Meseguer
173 An initial algebra approach to the specification (context) - Goguen, Thatcher et al.
162 Data types as lattices (context) - Scott - 1976
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1982
128 On understanding types (context) - Cardelli, Wegner - 1985
113 Functorial semantics of algebraic theories (context) - Lawvere - 1963
109 Putting theories together to make specifications (context) - Burstall, Goguen - 1977
86 A correspondence between ALGOL60 and Church's lambda notatio.. (context) - Landin - 1965
69 persistent interconnection and implementation of abstract mo.. (context) - Goguen, Meseguer - 1982
69 induction and computability (context) - Meseguer, Goguen - 1985
60 Technical Report SRICSL (context) - Goguen, Winkler
57 Some fundamental algebraic tools for the semantics of comput.. - Tarlecki, Burstall et al.
57 On observational equivalence and algebraic specification (context) - Sannella, Tarlecki
48 and generic modules for logic programming (context) - Goguen, Meseguer et al.
45 Jean-Pierre Jouannaud (context) - Futatsugi, Goguen - 1985
43 Department of Computer Science (context) - Harper, MacQueen et al. - 1986
41 Models and equality for logical programming (context) - Goguen, Meseguer
41 The basic building block of information systems (context) - Sernadas, Fiadeiro et al. - 1989
39 Sheaf semantics for concurrent interacting objects - Goguen
37 A kernel language for abstract data types and modules (context) - Burstall, Lampson - 1984
35 The Specification and Application to Programming of Abstract.. (context) - Guttag - 1975
35 a specification language (context) - Burstall, Goguen et al.
32 Final algebra semantics and data type extension (context) - Wand - 1979
31 Order-sorted algebra solves the constructor selector (context) - Goguen, Meseguer
30 Programmer's Manual (context) - McCarthy, Levin - 1966
26 Communications of the Association for Computing Machinery (context) - Hoare, processes - 1978
26 Hyperprogramming: A formal approach to software environments - Goguen - 1990
26 with logical semantics (context) - Goguen, Meseguer et al.
25 Higher-order functions considered unnecessary for higher-ord.. - Goguen
24 Specification techniques for data abstraction (context) - Liskov, Zilles - 1975
21 An algebraic approach to refinement (context) - Goguen - 1990
19 Mathematical representation of hierarchically organized syst.. (context) - Goguen - 1971
19 the Categorial Analysis of Logic (context) - Goldblatt - 1979
18 Abstract data types as initial algebras and the correctness .. (context) - Goguen, Thatcher et al. - 1975
15 An elementary theory of the category of sets (context) - Lawvere - 1964
14 data types and semantics (context) - Scott - 1972
13 Computer Science Department (context) - Mosses, institutions et al. - 1989
8 Initially restricting algebraic theories (context) - Reichel - 1980
8 Reusing and interconnecting software components (context) - Goguen
6 theories and freeness: An introduction for computer scientis.. (context) - Burstall, Goguen
3 IBM Watson Research Center (context) - Goguen, Thatcher et al. - 1975
3 ese de doctorat d"etat, Universit (context) - Girard, et et al. - 1972
2 and object identification (context) - Ehrich, Sernadas et al. - 1989
2 Hewlett-Packard Labs (context) - Hayes, Coleman et al. - 1989
1 Some remarks on data structures (context) - Goguen
1 Telescope mapping in typed lambda calculus (context) - de Bruijn
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ucsd.edu/users/goguen/pubs/): More
A Hidden Herbrand Theorem: Combining the Object and Logic.. - Goguen, Malcolm, Kemp (Correct)
Consciousness Studies - Goguen (2002) (Correct)
Order-Sorted Algebra I: Equational Deduction for Multiple.. - Goguen (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC