179 search results - page 17 / 36 » A Rewriting Logic Approach to Operational Semantics (Extende... |
LOPSTR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
TLDI
2010
ACM
14 years 4 months ago
2010
ACM
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...
AMAST
1998
Springer
14 years 4 days ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
APAL
2010
13 years 8 months ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...