Sciweavers

1989 search results - page 137 / 398
» Set functions for functional logic programming
Sort
View
POPL
2012
ACM
13 years 10 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
POPL
2007
ACM
16 years 3 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...

Book
314views
17 years 1 months ago
Programming in Martin-Löf's Type Theory
"This book describes different type theories (theories of types, polymorphic and monomorphic sets, and subsets) from a computing science perspective. It is intended for resear...
Bengt Nordström, Kent Petersson, Jan M. Smith
PLILP
1994
Springer
15 years 7 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
PASTE
2004
ACM
15 years 8 months ago
Validation of assembler programs for DSPs: a static analyzer
Digital Signal Processors are widely used in critical embedded systems to pilot low-level, often critical functionalities. We describe a static analyzer based on abstract interpre...
Matthieu Martel