Safe Recursive Boxes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Safe Recursive Boxes

Abstract

We study recursion in call-by-value functional languages, and more specifically a recursion construct recently introduced by Dreyer, which builds recursive boxed values. We design a type and effect system, featuring binary effects, for a call-by-value lambda-calculus extended with this recursion construct. We show that this system has the good properties required for an implicitly, statically typed language: the typable expressions do not yield run-time errors, and a principal type can be computed for any typable expression.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5115.pdf (270.68 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071467 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071467 , version 1

Cite

Gérard Boudol. Safe Recursive Boxes. RR-5115, INRIA. 2004. ⟨inria-00071467⟩
79 View
81 Download

Share

Gmail Facebook X LinkedIn More