Sciweavers

1342 search results - page 18 / 269
» Ordered Programs as Abductive Systems
Sort
View
POPL
1995
ACM
13 years 10 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
13 years 10 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 7 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
ESOP
2008
Springer
13 years 8 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
ESOP
2012
Springer
12 years 2 months ago
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho,...