6274 search results - page 144 / 1255 » Proofs, Programs, Processes |
192
click to vote
TYPES
1995
Springer
15 years 10 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
159
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
155
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
192
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
252
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...