Sciweavers

1763 search results - page 15 / 353
» A Formalization of Polytime Functions
Sort
View
POPL
1993
ACM
14 years 2 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
CPP
2011
107views more  CPP 2011»
12 years 10 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
AB
2008
Springer
14 years 4 months ago
Neural Algebra and Consciousness: A Theory of Structural Functionality in Neural Nets
Abstract. Thoughts are spatio-temporal patterns of coalitions of firing neurons and their interconnections. Neural algebras represent these patterns as formal algebraic objects, a...
Erwin Engeler
JAR
2008
101views more  JAR 2008»
13 years 10 months ago
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves
This article describes the formal verification of a compilation algorithm that transforms parallel moves (parallel assignments between variables) into a semanticallyequivalent sequ...
Laurence Rideau, Bernard P. Serpette, Xavier Leroy
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 1 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal