Sciweavers

154 search results - page 11 / 31
» Cobham recursive set functions
Sort
View
JACM
2007
84views more  JACM 2007»
13 years 7 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
POPL
2006
ACM
14 years 8 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
ICFP
2005
ACM
14 years 7 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
ALT
2010
Springer
13 years 7 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
ICCAD
2000
IEEE
113views Hardware» more  ICCAD 2000»
14 years 1 days ago
Don't Cares and Multi-Valued Logic Network Minimization
We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and sing...
Yunjian Jiang, Robert K. Brayton