Sciweavers

3001 search results - page 25 / 601
» Recursive type generativity
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 9 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
ENTCS
2002
77views more  ENTCS 2002»
13 years 8 months ago
Syntactic Type Soundness for HM(X)
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Christian Skalka, François Pottier
ALT
2001
Springer
14 years 5 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
ISCAS
2006
IEEE
124views Hardware» more  ISCAS 2006»
14 years 2 months ago
Distributed evidence filtering: the recursive case
Abstract— A novel approach named recursive evidence filtering for information processing in Distributed Sensor Networks (DSNs) is presented. It is based on the Dempster-Shafer (...
Duminda A. Dewasurendra, Peter H. Bauer, Kamal Pre...
LFP
1990
102views more  LFP 1990»
13 years 10 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo