662 search results - page 82 / 133 » Formalizing Basic First Order Model Theory |
110
click to vote
CADE
2009
Springer
15 years 6 months ago
2009
Springer
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 ...
184
click to vote
POPL
2007
ACM
16 years 5 days ago
2007
ACM
Type-preserving compilation can improve software reliability by generating code that can be verified independently of the compiler. Practical type-preserving compilation does not ...
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
CORR
1998
Springer
14 years 11 months ago
1998
Springer
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994 , the n...
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...