Sciweavers

479 search results - page 44 / 96
» The theory and calculus of aliasing
Sort
View
ENTCS
2002
129views more  ENTCS 2002»
13 years 8 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
LOGCOM
1998
80views more  LOGCOM 1998»
13 years 8 months ago
Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus
The Situation Calculus is a logic of time and change in which there is a distinguished initial situation ¡£¢ and all other situations arise from the different sequences of acti...
Javier Pinto
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 6 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
EUROCRYPT
2012
Springer
11 years 11 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
PEPM
2009
ACM
14 years 1 months ago
Translation and optimization for a core calculus with exceptions
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
Cristina David, Cristian Gherghina, Wei-Ngan Chin