Sciweavers

3670 search results - page 137 / 734
» Linear Recursive Functions
Sort
View
POPL
2006
ACM
16 years 5 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
2006
ACM
16 years 4 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons
132
Voted
IROS
2009
IEEE
168views Robotics» more  IROS 2009»
15 years 11 months ago
Developing visual sensing strategies through next best view planning
— We propose an approach for acquiring geometric 3D models using cameras mounted on autonomous vehicles and robots. Our method uses structure from motion techniques from computer...
Enrique Dunn, Jur P. van den Berg, Jan-Michael Fra...
127
Voted
TLCA
2005
Springer
15 years 10 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
CADE
1998
Springer
15 years 9 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary