Sciweavers

35 search results - page 3 / 7
» Parametric higher-order abstract syntax for mechanized seman...
Sort
View
ICFP
2003
ACM
14 years 6 months 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
CACM
2000
121views more  CACM 2000»
13 years 6 months ago
A broader approach to personalization
data model provides an abstract, conceptual framework; a concrete syntax is also required and XML is used for this purpose. The XML namespace mechanism serves to identify RDF Schem...
Ibrahim Cingil, Asuman Dogac, Ayca Azgin
EDOC
2003
IEEE
13 years 11 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel
TPHOL
2002
IEEE
13 years 11 months ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye
CC
2003
Springer
250views System Software» more  CC 2003»
13 years 11 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...