Sciweavers

605 search results - page 13 / 121
» Dynamic inference of abstract types
Sort
View
ESOP
2007
Springer
14 years 20 days ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
AMAST
1998
Springer
14 years 1 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
TPHOL
2000
IEEE
14 years 1 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
FSTTCS
1998
Springer
14 years 1 months ago
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems
Abstract. Synchronous languages are well suited for the design of dependable real-time systems: they enable a very high-level specification and an extremely modular implementation ...
Jean-Pierre Talpin, David Nowak
WWW
2004
ACM
14 years 9 months ago
Reactive rules inference from dynamic dependency models
Defining dependency models is sometimes an easier, more intuitive way for ontology representation than defining reactive rectly, as it provides a higher level of abstraction. We w...
Asaf Adi, Opher Etzion, Dagan Gilat, Royi Ronen, G...