Sciweavers

7 search results - page 1 / 2
» Primitive Recursion for Higher-Order Abstract Syntax
Sort
View
TLCA
1997
Springer
13 years 9 months ago
Primitive Recursion for Higher-Order Abstract Syntax
Joëlle Despeyroux, Frank Pfenning, Carsten Sc...
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
13 years 10 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
ENTCS
2008
140views more  ENTCS 2008»
13 years 5 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
ENTCS
2007
126views more  ENTCS 2007»
13 years 4 months ago
Nominal Reasoning Techniques in Coq: (Extended Abstract)
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
Brian E. Aydemir, Aaron Bohannon, Stephanie Weiric...
ICFP
2005
ACM
14 years 4 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...