Sciweavers

564 search results - page 15 / 113
» Dependent types and program equivalence
Sort
View
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 5 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel
CSL
2007
Springer
14 years 1 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
CSL
2004
Springer
14 years 1 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark
SAS
2005
Springer
134views Formal Methods» more  SAS 2005»
14 years 1 months ago
Using Dependent Types to Certify the Safety of Assembly Code
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...
Matthew Harren, George C. Necula