921 search results - page 8 / 185 » Expressing Computational Complexity in Constructive Type The... |
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
AAAI
1990
13 years 9 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The emerging technology of interacting systems calls for new forto ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics ha...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...