Sciweavers

899 search results - page 141 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
111
Voted
CADE
2007
Springer
16 years 22 days ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
ICFP
2003
ACM
16 years 12 days ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
116
Voted
ICFP
2003
ACM
16 years 12 days ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
ECAI
2004
Springer
15 years 5 months ago
Agent Planning, Negotiation and Control of Operation
Abstract. This paper presents a framework that integrates three aspects of agency: planning, for proactive behaviour, negotiation, for social behaviour and resource achievement, an...
Antonis C. Kakas, Paolo Torroni, Neophytos Demetri...
TPHOL
2003
IEEE
15 years 5 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd