Sciweavers

230 search results - page 20 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
ECSQARU
1997
Springer
13 years 11 months ago
Cactus: A Branching-Time Logic Programming Language
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
Panos Rondogiannis, Manolis Gergatsoulis, Themis P...
ICLP
1997
Springer
13 years 11 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
POPL
1993
ACM
13 years 11 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
CADE
2006
Springer
14 years 8 months ago
Dynamic Logic with Non-rigid Functions
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
Bernhard Beckert, André Platzer