Sciweavers

295 search results - page 52 / 59
» Games and Definability for System F
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
HICSS
2009
IEEE
189views Biometrics» more  HICSS 2009»
14 years 2 months ago
Predicting Change: A Study of the Value Frequency Model for Change of Practice
Information systems (IS) researchers have made considerable progress on defining and formalizing structured methods to support collaborative development of information systems. Co...
Robert O. Briggs, John D. Murphy, Thomas F. Carlis...
POPL
2008
ACM
14 years 7 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
SEMWEB
2009
Springer
14 years 2 months ago
Towards a Graphical Notation for OWL 2
The Ontology Definition Metamodel (ODM) defines a set of UML metamodels and profiles for development of RDF and OWL. The UML profiles in the ODM specification adapt UML notations t...
Elisa F. Kendall, Roy Bell, Roger Burkhart, Mark D...