Functorial ML

Functorial ML (1996)

Cached

Download Links

[www.disi.unige.it]
[linus.socs.uts.edu.au]

Other Repositories/Bibliography

DBLP

by G. Belle , C. B. Jay , E. Moggi

Citations:

27 - 9 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Functorial ML	user correction - Legacy Corrections
AUTHOR NAME	G. Belle	user correction - Legacy Corrections
AUTHOR NAME	C. B. Jay	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	E. Moggi	user correction - Legacy Corrections
AUTHOR AFFIL	; 2; 1; 2; DISI- Univ	user correction - Legacy Corrections
AUTHOR ADDR	; SOCS- Univ. of Tech. Sydney, P.O. Box 123 Broadway, 2007, Australia; di Genova, via Dodecaneso 35, 16146 Genova, Italy	user correction - Legacy Corrections
ABSTRACT	. We present an extension of the Hindley-Milner type system that supports a generous class of type constructors called functors, and provide a parametrically polymorphic algorithm for their mapping, i.e. for applying a function to each datum appearing in a value of constructed type. The algorithm comes from shape theory, which provides a uniform method for locating data within a shape. The resulting system is ChurchRosser and strongly normalising, and supports type inference. 1 Introduction The interplay between type theory, programming language semantics and category theory is now well established. Two of the strongest examples of this interaction are the representation of function types as exponential objects in a cartesian closed category [LS86] and the description of polymorphic terms as natural transformations (e.g. [BFSS90]). For example, the operation of appending lists can be represented as a natural transformation LL)L where L: D ! D is the list functor on some category D. ...	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	0 found	ParsCit 1.0