Sciweavers

17 search results - page 3 / 4
» Cartesian Programming: The TransLucid Programming Language
Sort
View
POPL
2008
ACM
14 years 5 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
FLOPS
2004
Springer
13 years 10 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
ESOP
2000
Springer
13 years 8 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 4 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
EUROPAR
2000
Springer
13 years 8 months ago
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
David S. Wise