2414 search results - page 51 / 483 » Computing Normal Subgroups |
TYPES
2004
Springer
14 years 29 days ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
PG
2003
IEEE
14 years 27 days ago
2003
IEEE
We present a method for the adaptive reconstruction of a surface directly from an unorganized point cloud. The algorithm is based on an incrementally expanding Neural Network and ...
CGI
2003
IEEE
14 years 28 days ago
2003
IEEE
In this paper, we propose a new interpolatory subdivision scheme for generating nice-looking curvature-continuous curves of round shapes. The scheme is based on a diffusion of nor...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
ILP
2000
Springer
13 years 11 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...