Sciweavers

5510 search results - page 169 / 1102
» Mathematics
Sort
View
102
Voted
ISSAC
1994
Springer
96views Mathematics» more  ISSAC 1994»
15 years 8 months ago
Automating the Construction of Stationary Multiple-Point Classes
In this paper, we describe an algorithm to compute arbitrary stationary multiple-point formulas. We report its full implementation in Maple and show some examples matching formula...
Sylvain Petitjean
119
Voted
ISSAC
1992
Springer
109views Mathematics» more  ISSAC 1992»
15 years 8 months ago
Easy Numbers for the Elliptic Curve Primality Proving Algorithm
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...
François Morain
127
Voted
LICS
1989
IEEE
15 years 8 months ago
Computational Lambda-Calculus and Monads
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gros...
Eugenio Moggi
MPC
1989
Springer
76views Mathematics» more  MPC 1989»
15 years 8 months ago
The Projection of Systolic Programs
A scheme is presented which transforms systolic programs with a two-dimensionalstructure to one dimension. The elementary steps of the transformation are justified by theorems in ...
Christian Lengauer, Jeff W. Sanders
ISSAC
1990
Springer
83views Mathematics» more  ISSAC 1990»
15 years 8 months ago
Resolution Proof Systems with Weak Transformation Rules
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
Zbigniew Stachniak