Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CTCS
1989
Springer

favoriteEmaildiscussreport

105views Programming Languages» more CTCS 1989»

A Category-theoretic Account of Program Modules

13 years 8 months ago

A Category-theoretic Account of Program Modules

Download www.disi.unige.it

The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions is independent from evaluation of programexpressions. We propose a new explanation based on “programming languages as indexed categories” and illustrates how ML can be extended to support higher order modules, by developing a category-theoretic semantics for a calculus of modules with dependent types. The paper outlines also a methodology, which may lead to a modular approach in the study of programming languages.

Eugenio Moggi

Real-time Traffic

CTCS 1989 | Indexed Categories | Programming Languages | Type-theoretic Explanation |

claim paper

Related Content

» The Category Theoretic Solution of Recursive Program Schemes

» A type system for higherorder modules

» From structures and functors to modules and units

» HigherOrder Modules and the Phase Distinction

» Using Parameterized Signatures to Express Modular Structure

» Reporting Failures in Functional Logic Programs

» Time Budgeting in a Wireplanning Context

» CPP Denotational Semantics

» Recursive type generativity

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1989
Where	CTCS
Authors	Eugenio Moggi

Comments (0)