Sciweavers

4211 search results - page 60 / 843
» Types as Abstract Interpretations
Sort
View
FM
2009
Springer
98views Formal Methods» more  FM 2009»
16 years 17 days ago
Recursive Abstractions for Parameterized Systems
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
Joxan Jaffar, Andrew E. Santosa
JSYML
2010
70views more  JSYML 2010»
15 years 24 days ago
The bounded functional interpretation of the double negation shift
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
Patrícia Engrácia, Fernando Ferreira
PEPM
2007
ACM
16 years 4 days ago
Bidirectional interpretation of XQuery
XQuery is a powerful functional language to query XML data. This paper presents a bidirectional interpretation of XQuery to address the problem of updating XML data through materi...
Dongxi Liu, Zhenjiang Hu, Masato Takeichi
CSL
2008
Springer
15 years 7 months ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
AGP
1993
IEEE
15 years 10 months ago
Static Analysis of Prolog with Cut
Abstract. This paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our...
Gilberto Filé, Sabina Rossi