35 search results - page 3 / 7 » Logic-flow analysis of higher-order programs |
TYPES
2000
Springer
13 years 9 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...
JELIA
1990
Springer
13 years 9 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
PLILP
1993
Springer
13 years 9 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
