Skip to search formSkip to main contentSkip to account menu

Defun

defun (short for "define function") is a macro in the Lisp family of programming languages that defines a function in the global environment that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Common LispEmacs LispGlobal variableLisp

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)
We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems. 
2014
2014
Obtaining an ACL2 Specification from an Isabelle/HOL Theory
In this work, we present an interoperability framework that enables the translation of specifications (signature of functions and… 
Review
2014
Review
2014
SYMBOLIC AND COGNITIVE THEORY IN BIOLOGY
In previous work, I have looked in detail at the capacity and the limits of the linguistics model as applied to gene expression… 
2009
2009
A recursion forms and their verification by using the inductive methods
It is considered both the recursion forms which exist for the functional languages, and the inductive methods with the goal of… 
2008
2008
Mapping and Visiting in Functional and Object-Oriented Programming
class Exp{ public abstract T Accept<T,D>(Visitor<T,D> v, D x); } class PlusExp : Exp { private Exp e1, e2; public PlusExp(Exp a… 
2007
2007
1. Using the New Common Lisp Pretty Printer
This technical report gathers together three papers that were written during 1992 and 1993 and submitted for publication in ACM… 
2004
2004
Axiomatic Events in ACL 2 ( r ) : A Story of defun , defun-std , and encapsulate
ACL2(r) is a variant of ACL2 that has support for reasoning about the real and complex numbers. It is based on the logic of non… 
1992
1992
The buried binding and dead binding problems of Lisp 1.5: sources of incomparability in garbage collector measurements
Lisp has become the language of choice for many applications such as artificial intelligence programs or symbol manipulation. The… 
1990
1990
The Nimble Type Inferencer for Common Lisp-84
interpretation is the name given to the generic process of "executing" a program on a lattice which is much simpler than the… 
1986
1986
Automatic Compilation of Logical Specifications into Efficient Programs
We describe an automatic programmer, or "compiler" which accepts as input a predicate calculus specification of a set to generate… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)