2540 search results - page 332 / 508 » Abstract Logics as Dialgebras |
ICFP
2010
ACM
13 years 12 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
POPL
2007
ACM
14 years 11 months ago
2007
ACM
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
POPL
2007
ACM
14 years 11 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
ICFP
2008
ACM
14 years 10 months ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
ICFP
2005
ACM
14 years 10 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...