Sciweavers

7430 search results - page 588 / 1486
» Programming Applications in CIFF
Sort
View
ICFP
2002
ACM
16 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
ICFP
2002
ACM
16 years 7 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
PLDI
2009
ACM
16 years 1 months ago
Typed self-representation
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
Tillmann Rendel, Klaus Ostermann, Christian Hofer
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
16 years 1 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
ICPP
2008
IEEE
16 years 1 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...