Sciweavers

383 search results - page 2 / 77
» Dependent Types for Low-Level Programming
Sort
View
ESOP
2001
Springer
13 years 10 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
LOPSTR
2004
Springer
13 years 11 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...
IFIP
2004
Springer
13 years 11 months ago
Dynamic Typing with Dependent Types
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Wa...
JFP
2007
112views more  JFP 2007»
13 years 5 months ago
Dependent ML An approach to practical programming with dependent types
We present an approach to enriching the type system of ML with a restricted form of de
Hongwei Xi
ICFP
1999
ACM
13 years 10 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich