Sciweavers

2206 search results - page 383 / 442
» On the power of coercion abstraction
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
CADE
2009
Springer
14 years 2 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
ECSQARU
2007
Springer
14 years 1 months ago
Towards an Extensible Argumentation System
Many types of inter-agent dialogue, including information seeking, negotiation and deliberation can be fruitfully seen as varieties of argumentation. Argumentation frameworks, ori...
Adam Zachary Wyner, Trevor J. M. Bench-Capon
ICCS
2007
Springer
14 years 1 months ago
Detecting Invisible Relevant Persons in a Homogeneous Social Network
Abstract. An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contempora...
Yoshiharu Maeno, Kiichi Ito, Yukio Ohsawa