Sciweavers

8021 search results - page 97 / 1605
» A Type System for Tom
Sort
View
LPAR
2012
Springer
12 years 4 months ago
The TPTP Typed First-Order Form with Arithmetic
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Pe...
APAL
2010
114views more  APAL 2010»
13 years 9 months ago
Classical predicative logic-enriched type theories
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
Robin Adams, Zhaohui Luo
LCR
2000
Springer
129views System Software» more  LCR 2000»
14 years 19 days ago
Run-Time Support for Distributed Sharing in Typed Languages
We present a new run-time system for typed programming languages that supports object sharing in a distributed system. The key insight in this system is that the ability to distin...
Y. Charlie Hu, Weimin Yu, Alan L. Cox, Dan S. Wall...
TGC
2007
Springer
14 years 3 months ago
On the Complexity of Termination Inference for Processes
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
FLOPS
2006
Springer
14 years 22 days ago
A Computational Approach to Pocklington Certificates in Type Theory
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Benjamin Grégoire, Laurent Théry, Be...