Sciweavers

366 search results - page 19 / 74
» Model-checking higher-order functions
Sort
View
FLOPS
2010
Springer
15 years 6 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
ICALP
2010
Springer
15 years 4 months ago
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
AGP
1999
IEEE
15 years 4 months ago
The Relative Complement Problem for Higher-Order Patterns
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
Alberto Momigliano, Frank Pfenning
SIGGRAPH
1993
ACM
15 years 3 months ago
Radiosity algorithms using higher order finite element methods
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
Roy Troutman, Nelson L. Max
ITP
2010
164views Mathematics» more  ITP 2010»
15 years 3 months ago
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
Jasmin Christian Blanchette, Tobias Nipkow