Sciweavers

3670 search results - page 88 / 734
» Linear Recursive Functions
Sort
View
ICFP
2004
ACM
16 years 2 months ago
Multi-return function call
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
Olin Shivers, David Fisher
125
Voted
TPHOL
2009
IEEE
15 years 9 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler
133
Voted
JAR
2010
160views more  JAR 2010»
15 years 1 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
122
Voted
ESOP
2009
Springer
15 years 6 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
125
Voted
INFORMATICALT
2002
103views more  INFORMATICALT 2002»
15 years 2 months ago
Numerical Representations as Purely Functional Data Structures: a New Approach
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...
Mirjana Ivanovic, Viktor Kuncak