Sciweavers

4498 search results - page 315 / 900
» How to Invent Functions
Sort
View
145
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 2 days ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
JOCN
2010
69views more  JOCN 2010»
14 years 12 months ago
Syntactic Unification Operations Are Reflected in Oscillatory Dynamics during On-line Sentence Comprehension
There is growing evidence suggesting that synchronization changes in the oscillatory neuronal dynamics in the EEG or MEG reflect the transient coupling and uncoupling of functiona...
Marcel C. M. Bastiaansen, Lilla Magyari, Peter Hag...
FROCOS
2011
Springer
14 years 4 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop
DAC
2004
ACM
16 years 6 months ago
Automated energy/performance macromodeling of embedded software
Efficient energy and performance estimation of embedded software is a critical part of any system-level design flow. Macromodeling based estimation is an attempt to speed up estim...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
POPL
2006
ACM
16 years 5 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao