3047 search results - page 338 / 610 » On the Meaning of Logical Completeness |
221
click to vote
VLSID
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose a novel, non-simulative, probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher ord...
173
click to vote
ICFP
2002
ACM
16 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
204
click to vote
PLPV
2010
ACM
16 years 4 months ago
2010
ACM
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
218
click to vote
WFLP
2009
Springer
16 years 2 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
230
click to vote
WETICE
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper describes WOLF, a development environment for WADE-based applications. WADE is a software platform, based on JADE, a popular Open Source framework, for the development ...