(Enter summary)
Abstract: . We introduce S2, a typed intermediate language for vectors,
based on a 2-level type-theory, which distinguishes between compile-time
and run-time. The paper shows how S2 can be used to extract useful information
from programs written in the Nested Sequence Calculus NSC,
an idealized high-level parallel calculus for nested sequences. We study
two translations from NSC to S2. The most interesting shows that shape
analysis (in the sense of Jay) can be handled at compile-time.
1 Introduction... (Update)
Context of citations to this paper: More
...size analysis, be it inference or checking, on types. a) Some groups draw a strong connection between types and sizes. Bell and Moggi [2] apply size inference in an intermediate language with a two level type system that distinguishes between compile time and runtime values...
Cited by: More
A Transformational Approach which Combines Size Inference.. - Herrmann, Lengauer (2001)
(Correct)
Similar documents (at the sentence level):
65.3%: Typed Intermediate Languages for Shape-Analysis - Bellè, Moggi (1997)
(Correct)
Active bibliography (related documents): More All
0.3: A Theory of Classes: Proofs and Models - Hilken, Rydeheard (1996)
(Correct)
0.1: On Plotkin-Abadi Logic for Parametric Polymorphism - Towards a.. - Maneggia
(Correct)
0.1: Partial Hyperdoctrines: Categorical Models for Partial.. - Knijnenburg, Nordemann (1993)
(Correct)
Similar documents based on text: More All
0.3: A Categorical Account of Two-Level Languages - Moggi (1997)
(Correct)
0.3: A Categorical Analysis of Multi-Level Languages.. - Benaissa, Moggi, Taha, .. (1999)
(Correct)
0.3: Closed Types for a Safe Imperative MetaML - Calcagno, Moggi, Sheard (2001)
(Correct)
Related documents from co-citation: More All
2: the relation between functional and data parallel programming languages (context) - Hammarlund, Lisper - 1993
2: Algebraic identities for program calculation (context) - Bird - 1989
2: Views: A Way for Pattern Matching to Cohabit with Data Abstraction
- Wadler - 1987
BibTeX entry: (Update)
Gianni Bell and Eugenio Moggi. Typed intermediate languages for shape-analysis. In TypedLambda Calculi and Applications (TLCA'97), Lecture Notes in Computer Science 1210, pages 1129. Springer-Verlag, 1997. http://citeseer.ist.psu.edu/article/bell97typed.html More
@misc{ bell97typed,
author = "G. Bell and E. Moggi",
title = "Typed intermediate languages for shape-analysis",
text = "Gianni Bell and Eugenio Moggi. Typed intermediate languages for shape-analysis.
In TypedLambda Calculi and Applications (TLCA'97), Lecture Notes in Computer
Science 1210, pages 1129. Springer-Verlag, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/article/bell97typed.html" }
Citations (may not include all citations):
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995 ACM DBLP
130
Implementation of a portable nested data-parallel language
- Blelloch, Chatterjee et al. - 1994 ACM DBLP
121
Higher-order modules and the phase distinction
- Harper, Mitchell et al. - 1990 ACM DBLP
83
From Region Inference to von Neumann Machines via Region Rep..
- Birkedal, Tofte et al. - 1996 ACM DBLP
80
A temporal-logic approach to binding-time analysis
- Davies - 1996 ACM DBLP
73
Inductively defined types (context) - Coquand, Paulin-Mohring - 1989 ACM DBLP
64
Science of Computer Programming (context) - Jay, for - 1995
62
Programming in Martin-Lof's type theory:an introduction (context) - Nordstrom, Petersson et al. - 1990
48
Introduction to extensive and distributive categories (context) - Carboni, Lack et al. - 1993
47
Information and Computation (context) - Talpin, Jouvelot et al. - 1994 DBLP
40
Unboxed values as first-class citizens (context) - Jones - 1991
39
A Typed Operational Semantics for Type Theory (context) - Goguen - 1994
34
Categorical Type Theory (context) - Jacobs - 1991 ACM
29
A category-theoretic account of program modules
- Moggi - 1991 ACM DBLP
24
Number 34 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Nielson, Nielson et al. - 1992
19
A provable time and space efficient implementation of NESL
- Blelloch, Greiner - 1996 ACM DBLP
18
Shape checking of array programs
- Jay, Sekanina - 1997
13
Shape in computing
- Jay - 1996 ACM DBLP
11
monads and the fast fourier transform (context) - Jay - 1994
10
Efficient compilation of high-level data parallel algorithms
- Suciu, Tannen - 1994 ACM DBLP
6
Notes on categorical logic (context) - Pitts - 1989
3
Relating models of impredicative type theories
- Jacobs, Moggi et al. - 1991 ACM DBLP
2
Summer School on Semantics and Logics of Computation (context) - Hofmann, Syntax et al. - 1995
Documents on the same site (http://www.disi.unige.it/person/BelleG/publications.html):
Monads, Shapely Functors and Traversals - Moggi, Bellè, Jay (1999)
(Correct)
Syntactical properties of an extension of Girard's System F where.. - Belle (1995)
(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