Sciweavers

7555 search results - page 93 / 1511
» The Type System of DBPL
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
WETICE
1999
IEEE
14 years 1 months ago
More Flexible Data Types
XML, as "the next generation ASCII", can play several roles in a distributed object system; one of the more exciting ones is as the basis for serialized data representat...
Mike Spreitzer, Andrew Begel
TABLEAUX
2009
Springer
14 years 3 months ago
Terminating Tableaux for the Basic Fragment of Simple Type Theory
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
Chad E. Brown, Gert Smolka
TPHOL
1992
IEEE
14 years 1 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
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