Sciweavers

1712 search results - page 154 / 343
» A Computational Approach to Binding Theory
Sort
View
ICCS
1995
Springer
15 years 5 months ago
Syntax, Semantics, and Pragmatics of Contexts
Thenotion of context is indispensable in discussions of meaning,but the wordcontext has often beenusedin conflicting senses. In logic, the first representation of contextas a forma...
John F. Sowa
TC
2010
15 years 4 days ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi
139
Voted
POPL
2012
ACM
13 years 9 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
DAC
2010
ACM
15 years 5 months ago
Circuit modeling for practical many-core architecture design exploration
Current tools for computer architecture design lack standard support for multi- and many-core development. We propose using circuit models to describe the multiple processor archi...
Dean Truong, Bevan M. Baas
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 1 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...