Sciweavers

258 search results - page 30 / 52
» Proof Styles in Operational Semantics
Sort
View
CSL
1999
Springer
13 years 11 months ago
Anti-Symmetry of Higher-Order Subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Adriana B. Compagnoni, Healfdene Goguen
FMOODS
2007
13 years 9 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 6 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
LOPSTR
2007
Springer
14 years 1 months ago
Denotation by Transformation
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...
Bernd Braßel, Jan Christiansen