Sciweavers

3658 search results - page 536 / 732
» The logic of proofs, semantically
Sort
View
TOCL
2012
235views Formal Methods» more  TOCL 2012»
13 years 9 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
ICSEA
2009
IEEE
16 years 1 months ago
Ontology Driven E-Government
: This paper presents an approach to model ontologies for the e-Government domain as a basis for an integrated e-Government environment. Over the last couple of years the applicati...
Peter Salhofer, Bernd Stadlhofer, Gerald Tretter
ICFP
2008
ACM
16 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
WWW
2004
ACM
16 years 7 months ago
Service Model for Collaborating Distributed Design and Manufacturing
This paper presents a Service-Oriented Process Model (SOM) to build a web-services based process management system, called MIDAS that would support distributed Design and Manufact...
Moon-Jung Chung, Woongsup Kim, Ravi Gopalan, Hong ...
LPNMR
2005
Springer
16 years 21 days ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir