169 search results - page 15 / 34 » A type system for well-founded recursion |
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
OSDI
1996
ACM
13 years 9 months ago
1996
ACM
This paper describes a novel approach to providingmodular and extensible operating system functionality and encapsulated environments based on a synthesis of microkernel and virtu...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channels due to intercarrier interference (ICI). Combining frequen...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...