Sciweavers

1321 search results - page 169 / 265
» Subtyping in Logical Form
Sort
View
POPL
2012
ACM
14 years 1 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
ICML
2009
IEEE
16 years 7 months ago
Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...
Filip Zelezný, Ondrej Kuzelka
CADE
2009
Springer
16 years 7 months ago
Does This Set of Clauses Overlap with at Least One MUS?
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
Éric Grégoire, Bertrand Mazure, C&ea...
CADE
2006
Springer
16 years 6 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
CADE
2006
Springer
16 years 6 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer