Sciweavers

1154 search results - page 38 / 231
» Implementing Typed Intermediate Languages
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
AOSD
2010
ACM
14 years 2 months ago
Type relaxed weaving
Statically typed aspect-oriented programming languages restrict application of around advice only to the join points that have conforming types. Though the restriction guarantees ...
Hidehiko Masuhara, Atsushi Igarashi, Manabu Toyama
EACL
2003
ACL Anthology
13 years 9 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
JCSS
2002
114views more  JCSS 2002»
13 years 7 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich