Sciweavers

4107 search results - page 17 / 822
» The Generalized Lambda Test
Sort
View
POPL
2007
ACM
16 years 1 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
ICFP
2005
ACM
16 years 1 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
ICFP
2002
ACM
16 years 1 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
LICS
2009
IEEE
15 years 8 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
PLDI
2006
ACM
15 years 7 months ago
Continuations and transducer composition
On-line transducers are an important class of computational agent; we construct and compose together many software systems using them, such as stream processors, layered network p...
Olin Shivers, Matthew Might