27 search results - page 2 / 6 » A logical analysis of aliasing in imperative higher-order fu... |
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
101
click to vote
TYPES
2000
Springer
15 years 1 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...