Results 1  10
of
548
Control Flow Analysis in Scheme
, 1988
"... Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran compilers, do not work for Schemelike languages. This paper presents a flow analysis technique control flow analysis which is applicable to Schemelike languages. As a demonstration application, the in ..."
Abstract

Cited by 231 (7 self)
 Add to MetaCart
, the information gathered by control flow analysis is used to perform a traditional flow analysis problem, induction variable elimination. Extensions and limitations are discussed. The techniques presented in this paper are backed up by working code. They are applicable not only to Scheme, but also to related
On Lie induction and the exceptional series
, 2004
"... Lie bialgebras occur as the principal objects in the infinitesimalisation of the theory of quantum groups—the semiclassical theory. Their relationship with the quantum theory has made available some new tools that we can apply to classical questions. In this paper, we study the simple complex Lie a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
algebras using the doublebosonisation construction of Majid. This construction expresses algebraically the induction process given by adding and removing nodes in Dynkin diagrams, which we call Lie induction. We first analyse the deletion of nodes, corresponding to the restriction of adjoint
The type theoretic interpretation of Constructive Set Theory: inductive definitions
 Logic, Methodology and Philosophy of Science VII
, 1986
"... Abstract. We present a generalisation of the typetheoretic interpretation of constructive set theory into MartinLöf type theory. The original interpretation treated logic in MartinLöf type theory via the propositionsastypes interpretation. The generalisation involves replacing MartinLöf type ..."
Abstract

Cited by 148 (9 self)
 Add to MetaCart
in the propositionsastypes interpretation of logic Our first aim here is to present a new typetheoretic interpretation of CZF. The novelty lies in replacing the pure type theory like ML 1 + W with a suitable logicenriched type theory. By a logicenriched intuitionistic type theory we mean an
Logical Characterisations Of Inductive Learning
, 2000
"... This chapter presents a logical analysis of induction. Contrary to common approaches to inductive logic that treat inductive validity as a realvalued generalisation of deductive validity, we argue that the only logical step in induction lies in hypothesis generation rather than evaluation. ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
This chapter presents a logical analysis of induction. Contrary to common approaches to inductive logic that treat inductive validity as a realvalued generalisation of deductive validity, we argue that the only logical step in induction lies in hypothesis generation rather than evaluation.
Deformations of Lie algebras and Induction of Schemes
, 2007
"... Let Lm be the scheme of the laws defined by the identities of Jacobi on K m. The local studies of an algebraic Lie algebra g = R ⋉ n in Lm and its nilpotent part n in the scheme L R n of Rinvariant Lie algebras on K n are linked. This comparison is made by means of slices, which are transversal sub ..."
Abstract
 Add to MetaCart
Let Lm be the scheme of the laws defined by the identities of Jacobi on K m. The local studies of an algebraic Lie algebra g = R ⋉ n in Lm and its nilpotent part n in the scheme L R n of Rinvariant Lie algebras on K n are linked. This comparison is made by means of slices, which are transversal
PRISM: an algorithm for inducing modular rules
 Int J ManMachine Studies
, 1987
"... The decision tree output of Quinlan's ID3 algorithm is one of its major weaknesses. Not only can it be incomprehensible and difficult to manipulate, but its use in expert systems frequently demands irrelevant information to be supplied. This report argues that the problem lies in the induction ..."
Abstract

Cited by 167 (0 self)
 Add to MetaCart
The decision tree output of Quinlan's ID3 algorithm is one of its major weaknesses. Not only can it be incomprehensible and difficult to manipulate, but its use in expert systems frequently demands irrelevant information to be supplied. This report argues that the problem lies in the induction
GENERALIZED ARTIN AND BRAUER INDUCTION FOR COMPACT LIE GROUPS
, 2008
"... Let G be a compact Lie group. We present two induction theorems for certain generalized Gequivariant cohomology theories. The theory applies to Gequivariant Ktheory KG, and to the Borel cohomology associated with any complex oriented cohomology theory. The coefficient ring of KG is the represen ..."
Abstract
 Add to MetaCart
Let G be a compact Lie group. We present two induction theorems for certain generalized Gequivariant cohomology theories. The theory applies to Gequivariant Ktheory KG, and to the Borel cohomology associated with any complex oriented cohomology theory. The coefficient ring of KG
Braidedlie Bialgebras
 PACIFIC JOURNAL OF MATHEMATICS VOL. 192, NO. 2, 2000
, 2000
"... We introduce braided Lie bialgebras as the infinitesimal version of braided groups. They are Lie algebras and Lie coalgebras with the coboundary of the Lie cobracket an infinitesimal braiding. We provide theorems of transmutation, Lie biproduct, bosonisation and doublebosonisation relating braided ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
cobracket. Other nontrivial braidedLie bialgebras are associated to the inductive construction of simple Lie bialgebras along the C and exceptional series.
BRAIDED LIE BIALGEBRAS
, 1997
"... We introduce braided Lie bialgebras as the infinitesimal version of braided groups. They are Lie algebras and Lie coalgebras with the coboundary of the Lie cobracket an infinitesimal braiding. We provide theorems of transmutation, Lie biproduct, bosonisation and doublebosonisation relating braided ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Sklyanin Lie cobracket. Other nontrivial braidedLie bialgebras are associated to the inductive construction of simple Lie bialgebras along the C and exceptional series.
Results 1  10
of
548