571 search results - page 10 / 115 » Domain Theory in Logical Form |
IJCAI
1989
14 years 10 months ago
1989
N IN AN ABSTRACTION SPACE: A Form of Constructive Induction George Drastal and Gabor Czako Siemens Research and Technology Laboratories 755 College Rd Princeton, NJ 08540 We repor...
ENTCS
2006
14 years 9 months ago
2006
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
101
Voted
PLPV
2009
ACM
15 years 6 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
70
Voted
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
Auctions are pervasive in today’s society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by int...
SIAMNUM
2011
14 years 4 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...