1894 search results - page 291 / 379 » A TLA Proof System |
139
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
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...
141
Voted
TIC
2000
Springer
15 years 7 months ago
2000
Springer
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
109
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
The web, as a real mass medium, has become an invaluable data source for Information Extraction and Retrieval systems. Digital authoring is a relatively new style of communication,...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...