Sciweavers

10 search results - page 1 / 2
» Quantification in tail-recursive function definitions
Sort
View
TYPES
2000
Springer
13 years 10 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
JAR
2010
122views more  JAR 2010»
13 years 1 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
ACL2
2006
ACM
13 years 10 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
13 years 10 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
ESOP
2009
Springer
13 years 10 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts