Sciweavers

632 search results - page 5 / 127
» Explicit Substitutions and Programming Languages
Sort
View
POPL
2006
ACM
14 years 7 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
PADL
2010
Springer
14 years 4 months ago
Explicitly Typed Exceptions for Haskell
Abstract. We describe a monad for checked, explicitly typed exceptions, which provides as a simple Haskell library what for other languages is a native feature. Multi parameter typ...
José Iborra
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 5 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICALP
2009
Springer
14 years 7 months ago
An Explicit Formula for the Free Exponential Modality of Linear Logic
Christine Tasson, Nicolas Tabareau, Paul-Andr&eacu...
ICDE
2008
IEEE
208views Database» more  ICDE 2008»
14 years 8 months ago
Clip: a Visual Language for Explicit Schema Mappings
Many data integration solutions in the market today include tools for schema mapping, to help users visually relate elements of different schemas. Schema elements are connected wit...
Alessandro Raffio, Daniele Braga, Mauricio A. Hern...