License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08271.3
URN: urn:nbn:de:0030-drops-16546
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1654/
Go to the corresponding Portal

Plaice, John ; Mancilla, Blanca

Cartesian Programming: The TransLucid Programming Language

pdf-format:
08271.PlaiceJohn.Paper.1654.pdf (0.2 MB)

Abstract

The TransLucid programming language is a low-level intensional language, designed to be sufficiently rich for it to be the target language for translating the common programming paradigms into it, while still being fully declarative. The objects manipulated by TransLucid, called hyperdatons, are arbitrary-dimensional infinite arrays, indexed by multidimensional tuples of arbitrary types. We present the syntax, denotational and operational semantics for a simple TransLucid system, consisting of 1) a header detailing how expressions should be parsed, 2) a set of libraries of types, and operations thereon, defined in a host language, 3) a set of TransLucid equations, and 4) a TransLucid demand to be evaluated. The evaluation of a demand for an (identifier, context) pair is undertaken using eduction, where previously computed pairs are stored in a cache called a warehouse. The execution ensures that only those dimensions actually encountered during the execution of an expression are taken into account when caching intermediate results.

BibTeX - Entry

@InProceedings{plaice_et_al:DagSemProc.08271.3,
  author =	{Plaice, John and Mancilla, Blanca},
  title =	{{Cartesian Programming: The TransLucid Programming Language}},
  booktitle =	{Topological and Game-Theoretic Aspects of Infinite Computations},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8271},
  editor =	{Peter Hertling and Victor Selivanov and Wolfgang Thomas and William W. Wadge and Klaus Wagner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1654},
  URN =		{urn:nbn:de:0030-drops-16546},
  doi =		{10.4230/DagSemProc.08271.3},
  annote =	{Keywords: Cartesian programming, Lucid language, declarative programming, multidimensional programming, context-aware programming, semantics.}
}

Keywords: Cartesian programming, Lucid language, declarative programming, multidimensional programming, context-aware programming, semantics.
Collection: 08271 - Topological and Game-Theoretic Aspects of Infinite Computations
Issue Date: 2008
Date of publication: 05.11.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI