297 search results - page 41 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
201
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
116
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
TACS
1994
Springer
15 years 5 months ago
1994
Springer
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
194
click to vote
POPL
2005
ACM
16 years 1 months ago
2005
ACM
Network protocol design is usually an informal process where debugging is based on successive iterations of a prototype implementation. The feedback provided by a prototype can be...