(Enter summary)
Abstract: provide a formal but intuitive
way of presenting and reasoning about programs, which is widely used in practice, although in an
informal or semi-formal fashion. In this thesis, we investigate categorical models of programming
languages based on a graphical presentation.
In the first part, we use a graphical presentation of processes to motivate a categorical model
of processes which provides process types and constructors similar to those available in categories
of graphs. The model is... (Update)
Cited by: More
Explicit Fusions - Wischik, Gardner (2000)
(Correct)
Similar documents (at the sentence level):
49.2%: Categorical and Graphical Models of Programming Languages - Part I - Schweimeier (2001)
(Correct)
19.6%: Categorical and Graphical Models of Programming Languages - Part .. - Schweimeier (2001)
(Correct)
Active bibliography (related documents): More All
0.6: Presheaf Models Concurrency - Cattani (1999)
(Correct)
0.5: Categorical Models for Concurrency: Independence, Fairness and.. - Hildebrandt (2000)
(Correct)
0.4: Sober Spaces And Continuations - Taylor (2002)
(Correct)
Similar documents based on text: More All
0.3: Unsupervised Language Acquisition: Theory and Practice - Clark (2001)
(Correct)
0.3: Lexical Acquisition at the Syntax-Semantics Interface: Diathesis .. - McCarthy (2001)
(Correct)
0.3: A Neurosymbolic Approach to the Classification of Scarce and.. - Sanchez (1999)
(Correct)
BibTeX entry: (Update)
R. Schweimeier. Categorical and Graphical Models of Programming Languages. PhD thesis, University of Sussex, 2001. http://citeseer.ist.psu.edu/schweimeier01categorical.html More
@misc{ schweimeier01categorical,
author = "R. Schweimeier",
title = "Categorical and Graphical Models of Programming Languages",
text = "R. Schweimeier. Categorical and Graphical Models of Programming Languages.
PhD thesis, University of Sussex, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/schweimeier01categorical.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
1933
Communication and Concurrency (context) - Milner - 1989
982
Theoretical Computer Science (context) - Girard - 1987 ACM
562
Categories for the Working Mathematician (context) - Lane - 1971
521
Compiling with Continuations (context) - Appel - 1992 ACM
384
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
382
Lambda calculi with types
- Barendregt - 1992 ACM
369
Information and Computation (context) - Moggi, computation - 1991 DBLP
291
Computational lambda-calculus and monads
- Moggi - 1989 ACM DBLP
268
Proofs and Types (context) - Girard, Lafont et al. - 1989
232
Category Theory for Computing Science (context) - Barr, Wells - 1995 ACM
218
The mechanical evaluation of expressions (context) - Landin - 1964
216
Theoretical Computer Science (context) - Milner, synchrony - 1983 ACM
161
Fundamentals of Algebraic Specification (context) - Ehrig, Mahr - 1985
152
Semantics of Programming Languages (context) - Gunter - 1992 ACM
149
calculus: a tutorial (context) - Milner, p- - 1991
144
Models for concurrency
- Winskel, Nielsen - 1995
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996 ACM DBLP
125
Event structures (context) - Winskel - 1987 ACM DBLP
116
Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1996
109
The Implementation of Functional Programming Languages (context) - Jones - 1987
108
Linearity and the pi-calculus
- Kobayashi, Pierce et al. - 1996 ACM DBLP
106
The categorical abstract machine (context) - Cousineau, Curien et al. - 1987
89
Calculi for interaction
- Milner - 1996
89
closure-passing style (context) - Appel, Jim - 1989
87
call-by-value and the lambda-calculus (context) - Plotkin - 1975
84
Basic Category Theory for Computer Scientists (context) - Pierce - 1991 ACM
69
Information and Computation (context) - Joyal, Nielsen et al. - 1996 DBLP
69
Abstract syntax and variable binding (context) - Fiore, Plotkin et al. - 1999 ACM DBLP
69
Triples and Theories (context) - Barr, Wells - 1985
64
Cambridge University Press (context) - Crole, Types - 1993
61
The fusion calculus: Expressiveness and symmetry in mobile p..
- Parrow, Victor - 1998 DBLP
58
Presheaf models for concurrency
- Cattani, Winskel - 1996 ACM DBLP
45
Communicating and Mobile Systems: the Pi-Calculus (context) - Milner - 1999
40
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
39
Retracing some paths (context) - Abramsky - 1996
38
Mathematical Structures in Computer Science (context) - Power, Robinson et al. - 1997
38
Categorical Logic and Type Theory (context) - Jacobs - 1999
38
Selective and lightweight closure conversion
- Wand, Steckler - 1994 ACM DBLP
38
Traced monoidal categories (context) - Joyal, Street et al. - 1996
36
Interaction categories and the foundations of typed concurre..
- Abramsky, Gay et al. - 1996 ACM
34
Lambda lifting: transforming programs to recursive equations
- Johnsson - 1985
31
Names and Higher-Order Functions
- Stark - 1994
31
Journal of Pure and Applied Algebra (context) - Carboni, Walters - 1987
30
Control categories and duality: on the categorical semantics..
- Selinger - 1998 ACM DBLP
29
Coherence for compact closed categories (context) - Kelly, Laplaza - 1980
29
Recursion from cyclic sharing: Traced monoidal categories an..
- Hasegawa - 1997
27
A presheaf semantics of value-passing processes
- Winskel - 1996 ACM DBLP
25
Handbook of Categorical Algebra (context) - Borceux - 1994
25
Handbook of Categorical Algebra (context) - Borceux - 1994
24
A call-by-need lambda calculus
- Maraist, Odersky et al. - 1998 ACM
23
Theoretical Computer Science (context) - Stoughton - 1988 ACM
23
Type systems for closure conversion
- Hannan - 1995
22
Weak bisimulation and open maps
- Fiore, Cattani et al. - 1999 ACM DBLP
21
A theory of recursive domains with applications to concurren..
- Cattani, Fiore et al. - 1998 ACM DBLP
21
Models of Sharing Graphs: A Categorical Semantics of let and.. (context) - Hasegawa - 1997
19
A typed calculus of synchronous processes
- Gay, Nagarajan - 1995
18
A calculus of mobile processes I + II (context) - Milner, Parrow et al. - 1992
18
First-order axioms for asynchrony
- Selinger - 1997 ACM DBLP
17
Premonoidal categories as categories with algebraic structur.. (context) - Power ACM DBLP
14
Complete axioms for categorical fixed-point operators
- Simpson, Plotkin - 2000 ACM DBLP
13
Theoretical Computer Science (context) - Gardner, calculi - 1999 ACM
13
Allegories of circuits
- Brown, Jeffrey - 1994 ACM DBLP
12
Contexts and embeddings for closed shallow action graphs
- Cattani, Leifer et al. - 2000
11
On explicit substitutions and names
- de Paiva, Ritter - 1997
11
Type systems for concurrent processes: From deadlock-freedom.. (context) - Kobayashi - 2000
10
Explicit fusions
- Gardner, Wischik - 2000
10
Introduction to bicategories (context) - Bnabou - 1967
9
Direct models for the computational lambda-calculus (context) - Fhrmann - 2000
9
Direct models for the computational lambda-calculus (context) - Fhrmann - 1999
9
Modern Compiler Implementation (context) - Appel - 1998 ACM
8
A fully abstract domain model for the pi-calculus (context) - Stark - 1996 DBLP
7
Continuation semantics and self-adjointness
- Thielecke - 1997 DBLP
7
A type-theoretic approach to deadlock-freedom of asynchronou..
- Abramsky, Gay et al. - 1997 ACM DBLP
6
A relational model of non-deterministic dataflow
- Hildebrandt, Panangaden et al. - 1998
6
Typed closure conversion for recursively-defined functions
- Morrisett, Harper - 1998 DBLP
6
Object closure conversion
- Glew - 2000 ACM DBLP
5
and Glynn Winskel (context) - Cattani, Stark - 1997
5
continuation semantics and indexed categories (context) - Power, Thielecke - 1997
5
Categorical structure of asynchrony (context) - Selinger - 1999 DBLP
4
Computer Science Technical Report (context) - Reppy, Ph et al. - 1992
4
An internal language for interaction categories (context) - Crole, Gay et al. - 1995
3
A categorical and graphical treatment of closure conversion
- Schweimeier, Jeffrey - 1999 DBLP
3
A fully-abstract model for the p-calculus (context) - Moggi, Fiore et al. - 1996 ACM
3
Closed Freyd- and k-categories
- Power, Thielecke - 1999
3
Advances in Petri Nets (context) - Reisig, editors - 1987
3
Presented at the Mathfit Instructional Meeting on Recent Adv.. (context) - Gardner, of - 1998
3
Flow graphs and semantics of programs (context) - Jeffrey - 1998
1
Available electronically from httpwww (context) - Gardner, Symmetric et al. - 1999
1
A sort inference algorithm for the polyadic p-calculus (context) - Gay - 1993
1
Available electronically as ftp://ftp (context) - Milner, Reflexive et al. - 1994
1
Available electronically as httpklee (context) - Jeffrey, applet et al. - 1997
Documents on the same site (http://www.cogs.susx.ac.uk/users/ralfs/thesis/thesis.html):
Categorical and Graphical Models of Programming Languages - Part I - Schweimeier (2001)
(Correct)
Categorical and Graphical Models of Programming Languages - Part .. - Schweimeier (2001)
(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