Sciweavers

1154 search results - page 72 / 231
» Implementing Typed Intermediate Languages
Sort
View
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
14 years 2 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
CC
2005
Springer
106views System Software» more  CC 2005»
14 years 2 months ago
Source-Level Debugging for Multiple Languages with Modest Programming Effort
Abstract. We present techniques that enable source-level debugging for multiple languages at the cost of only modest programming effort. The key idea is to avoid letting debugging ...
Sukyoung Ryu, Norman Ramsey
POPL
2007
ACM
14 years 9 months ago
Cork: dynamic memory leak detection for garbage-collected languages
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...
Maria Jump, Kathryn S. McKinley
POPL
2012
ACM
12 years 4 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
LICS
2012
IEEE
11 years 11 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino