Sciweavers

360 search results - page 12 / 72
» Dependently Typed Programming in Agda
Sort
View
CSL
2004
Springer
14 years 29 days 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
FROCOS
2011
Springer
12 years 7 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop
CIE
2008
Springer
13 years 9 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
11 years 10 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen