518 search results - page 21 / 104 » Automating Proofs in Category Theory |
159
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
194
click to vote
ELP
1991
15 years 9 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
159
click to vote
LICS
2008
IEEE
16 years 17 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
189
click to vote
TPHOL
2008
IEEE
16 years 16 days ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
164
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...