Sciweavers

441 search results - page 9 / 89
» The logical approach to stack typing
Sort
View
FLAIRS
2008
14 years 11 months ago
Causal Reasoning with Contexts Using Dependent Types
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic...
Richard Dapoigny, Patrick Barlatier
SCP
2010
155views more  SCP 2010»
14 years 7 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
TACAS
2012
Springer
275views Algorithms» more  TACAS 2012»
13 years 5 months ago
Pushdown Model Checking for Malware Detection
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...
Fu Song, Tayssir Touili
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
PADL
2004
Springer
15 years 2 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi