1301 search results - page 25 / 261 » Specifications via Realizability |
SAC
2006
ACM
13 years 7 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
MSCS
2006
13 years 7 months ago
2006
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
ENTCS
2002
13 years 7 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
IJCSA
2008
13 years 7 months ago
2008
ADAPTAPlan project provides dynamic assistance for reducing authors' effort in developing instructional design tasks using user modelling, planning and machine learning techn...
CI
2005
13 years 7 months ago
2005
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...