Parametric limits

BP Dunphy; Uday Reddy

doi:10.1109/LICS.2004.1319618

Parametric limits

BP Dunphy
, Uday Reddy

Computer Science

Research output: Contribution to conference (unpublished) › Paper › peer-review

16 Citations (Scopus)

347 Downloads (Pure)

Abstract

We develop a categorical model of polymorphic lambda calculi using a notion called parametric limits, which extend the notion of limits in categories to reflexive graphs of categories. We show that a numberof parametric models of polymorphism can be captured in this way. We also axiomatize the structure of reflexive graphs needed for modelling parametric polymorphism based on ideas of fibrations, and show that it leads to proofs of representation results such as the initial algebra and final coalgebra properties one expects in polymorphic lambda calculi.

Original language	English
Pages	242-253
Number of pages	12
DOIs	https://doi.org/10.1109/LICS.2004.1319618
Publication status	Published - 1 Jan 2004
Event	Nineteenth Annual IEEE Symposium on Logic in Computer Science - Duration: 1 Jan 2004 → …

Conference

Conference	Nineteenth Annual IEEE Symposium on Logic in Computer Science
Period	1/01/04 → …

ASJC Scopus subject areas

Computational Theory and Mathematics
Theoretical Computer Science

Access to Document

10.1109/LICS.2004.1319618

parametric
Copyright, IEEE
Accepted author manuscript, 201 KB

16 Citations
2 Paper
2 Article
1 Conference contribution

Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
Reddy, U., 4 Nov 2013, p. 325-348. 24 p.
Research output: Contribution to conference (unpublished) › Paper › peer-review
An Automata-Theoretic Model of Idealized Algol
Reddy, U. & Dunphy, B. P., 2012, Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Czumaj, A., Mehlhorn, K., Pitts, A. & Wattenhofer, R. (eds.). Springer, p. 337-350 (Lecture Notes in Computer Science; vol. 7392).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)
An Automata-Theoretic Model of Objects
Reddy, U. & Dunphy, B., 23 Oct 2011. 15 p.
Research output: Contribution to conference (unpublished) › Paper

Open Access
File
Correctness of data representations involving heap data structures
Reddy, U. & Yang, H., 1 Jan 2004, In: Science of Computer Programming. 50, 1-3, p. 129-160 32 p.
Research output: Contribution to journal › Article › peer-review

Open Access
File
26 Citations (Scopus)

272 Downloads (Pure)
Objects and Classes in Algol-like Languages
Reddy, U., 10 Jan 2002, In: Information and Computation. 172, 1, p. 63-97 35 p.
Research output: Contribution to journal › Article › peer-review

File

11 Citations (Scopus)

292 Downloads (Pure)

Cite this

@conference{3a47f7137d3f4835ae21fb0b82093929,

title = "Parametric limits",

abstract = "We develop a categorical model of polymorphic lambda calculi using a notion called parametric limits, which extend the notion of limits in categories to reflexive graphs of categories. We show that a numberof parametric models of polymorphism can be captured in this way. We also axiomatize the structure of reflexive graphs needed for modelling parametric polymorphism based on ideas of fibrations, and show that it leads to proofs of representation results such as the initial algebra and final coalgebra properties one expects in polymorphic lambda calculi. ",

author = "BP Dunphy and Uday Reddy",

year = "2004",

month = jan,

day = "1",

doi = "10.1109/LICS.2004.1319618",

language = "English",

pages = "242--253",

note = "Nineteenth Annual IEEE Symposium on Logic in Computer Science ; Conference date: 01-01-2004",

}

TY - CONF

T1 - Parametric limits

AU - Dunphy, BP

AU - Reddy, Uday

PY - 2004/1/1

Y1 - 2004/1/1

N2 - We develop a categorical model of polymorphic lambda calculi using a notion called parametric limits, which extend the notion of limits in categories to reflexive graphs of categories. We show that a numberof parametric models of polymorphism can be captured in this way. We also axiomatize the structure of reflexive graphs needed for modelling parametric polymorphism based on ideas of fibrations, and show that it leads to proofs of representation results such as the initial algebra and final coalgebra properties one expects in polymorphic lambda calculi.

AB - We develop a categorical model of polymorphic lambda calculi using a notion called parametric limits, which extend the notion of limits in categories to reflexive graphs of categories. We show that a numberof parametric models of polymorphism can be captured in this way. We also axiomatize the structure of reflexive graphs needed for modelling parametric polymorphism based on ideas of fibrations, and show that it leads to proofs of representation results such as the initial algebra and final coalgebra properties one expects in polymorphic lambda calculi.

U2 - 10.1109/LICS.2004.1319618

DO - 10.1109/LICS.2004.1319618

M3 - Paper

SP - 242

EP - 253

T2 - Nineteenth Annual IEEE Symposium on Logic in Computer Science

Y2 - 1 January 2004

ER -

Parametric limits

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Fingerprint

Research output

Automata-Theoretic Semantics of Idealized Algol with Passive Expressions

An Automata-Theoretic Model of Idealized Algol

An Automata-Theoretic Model of Objects

Correctness of data representations involving heap data structures

Objects and Classes in Algol-like Languages

Cite this