Sciweavers

412 search results - page 16 / 83
» Innovations in computational type theory using Nuprl
Sort
View
CCA
2005
Springer
14 years 1 months ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson
FOCS
1998
IEEE
14 years 8 days ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
ACL
2004
13 years 9 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
CADE
1998
Springer
14 years 7 days ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
JITECH
2008
117views more  JITECH 2008»
13 years 8 months ago
Towards a theory of organizational information services
: The use of information technology (IT) in organizations has undergone dramatic changes the past 30 years. As a result, it has become increasingly common to adopt a services rathe...
Lars Mathiassen, Carsten Sørensen