58 search results - page 11 / 12 » A Logic Programming View of Relational Morphology |
POPL
2007
ACM
14 years 6 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
SYNTHESE
2011
13 years 1 months ago
2011
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
CADE
2003
Springer
14 years 6 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
PLDI
2005
ACM
13 years 11 months ago
2005
ACM
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
LACL
2001
Springer
13 years 10 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...