1 citations · 1 across the 2 of their papers we have counts for
4 papers · 1 filter
Higher-Order MSL Horn Constraints
Jerome Jochems, Eddie Jones, Steven Ramsay
The monadic shallow linear (MSL) class is a decidable fragment of first-order Horn clauses that was discovered and rediscovered around the turn of the century, with applications in…
Verifying Liveness Properties of ML Programs
M. M. Lester, R. P. Neatherway, C. -H. L. Ong +1
Higher-order recursion schemes are a higher-order analogue of Boolean Programs; they form a natural class of abstractions for functional programs. We present a new, efficient algor…
Intensional Datatype Refinement
Eddie Jones, Steven Ramsay
The pattern-match safety problem is to verify that a given functional program will never crash due to non-exhaustive patterns in its function definitions. We present a refinement t…
Defunctionalization of Higher-Order Constrained Horn Clauses
Long Pham, Steven J. Ramsay, C. -H. Luke Ong
Building on the successes of satisfiability modulo theories (SMT), Bjørner et al. initiated a research programme advocating Horn constraints as a suitable basis for automatic progr…