Sciweavers

128 search results - page 13 / 26
» Declarative Representation of Proof Terms
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 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...
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
IMC
2006
ACM
14 years 1 months ago
binpac: a yacc for writing application protocol parsers
A key step in the semantic analysis of network traffic is to parse the traffic stream according to the high-level protocols it contains. This process transforms raw bytes into s...
Ruoming Pang, Vern Paxson, Robin Sommer, Larry L. ...
ILP
1998
Springer
13 years 12 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...