35 search results - page 3 / 7 » Logic-flow analysis of higher-order programs |
147
Voted
TYPES
2000
Springer
15 years 6 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...
129
Voted
JELIA
1990
Springer
15 years 6 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...
209
Voted
FSTTCS
2010
Springer
15 years 3 days 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...
99
Voted
PLILP
1993
Springer
15 years 6 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 ...
91
Voted
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
