• Suche: "ACM: F.: Theory of Computation"

Treffer 241 - 260 von 1.806

241

Parametricity in an Impredicative Sort
Keller, Chantal ; Lasson, Marc ; Types, Logic and computing (TYPICAL) ; et al.
CSL - 26th International Workshop/21st Annual Conference of the EACSL - 2012. :381-395

Fontainebleau, France Calculus of Inductive Co... parametricity impredicativity Coq universes …
Konferenz
Zu den Favoriten
242

TLA+ Proofs
Cousineau, Denis ; Doligez, Damien ; Lamport, Leslie ; et al.
18th International Symposium On Formal Methods - FM 2012. :147-154

Paris, France ACM: D.: Software D.2: SOFTWARE ENGINEERIN... D.2.4: Software Program Verification D.2.4.2: Correctness pro... …
Konferenz
Zu den Favoriten
243

Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots
Sheikh, Saad ; Backofen, Rolf ; Ponty, Yann ; et al.
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012. :321-333

Helsinki, Finland RNA folding General pseudoknots Hardness Inapproximability ACM: J.: Computer Applic... …
Konferenz
Zu den Favoriten
244

A Constructive Proof of Dependent Choice, Compatible with Classical Logic
Herbelin, Hugo ; Preuves, Programmes et Systèmes (PPS) ; Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) ; et al.
LICS 2012 - 27th Annual ACM/IEEE Symposium on Logic in Computer Science. :365-374

Dubrovnik, Croatia Dependent choice classical logic constructive logic strong existential ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
245

Classical call-by-need sequent calculi : The unity of semantic artifacts
Ariola, Zena ; Downen, Paul ; Herbelin, Hugo ; et al.
FLOPS 2012 - 11th International Symposium on Functional and Logic Programming. :32-46

Kobe, Japan call-by-need lazy evaluation duality of computation sequent calculus lambda-mu-calculus …
Konferenz
Zu den Favoriten
246

A non-local method for robustness analysis of floating point programs
Gazeau, Ivan ; Miller, Dale ; Palamidessi, Catuscia ; et al.
QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages. :63-76

Tallinn, Estonia robustness to errors. floating-point arithmeti... Program analysis robustness to errors ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
247

The dimension of ergodic random sequences
Hoyrup, Mathieu ; Theoretical adverse computations, and safety (CARTE) ; Centre Inria de l'Université de Lorraine ; et al.
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science). :567-576

Paris, France Shannon-McMillan-Breiman... Martin-Löf random sequen... effective Hausdorff dime... compression rate entropy …
Konferenz
Zu den Favoriten
248

Herbrand-Gödel 1931 - Note introductive
Égré, Paul ; Institut Jean-Nicod (IJN) ; Département d'Etudes Cognitives - ENS-PSL (DEC) ; et al.
Michel Bourdeau; Jean Mosconi. Anthologie de la calculabilité. :201-211

ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... [MATH.MATH-LO]Mathematic... Logic [math.LO] [INFO.INFO-LO]Computer S... Logic in Computer Scienc... …
Buch
Zu den Favoriten
249

Anonymous Agreement: The Janus Algorithm
Bouzid, Zohir ; Sutra, Pierre ; Travers, Corentin ; et al.
OPODIS'11 - 15th International Conference On Principles Of Distributed Systems. :175-190

Toulouse, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DC]Computer S... Distributed, Parallel, a...
Konferenz
Zu den Favoriten
250

Parametric Polymorphism and Semantic Subtyping: the Logical Connection
Gesbert, Nils ; Genevès, Pierre ; Layaïda, Nabil ; et al.
International conference on functional programming. :107-116

Tokyo, Japan subtyping Polymorphism Type-system ACM: D.: Software D.3: PROGRAMMING LANGUAG... …
Konferenz
Zu den Favoriten
251

The Focused Calculus of Structures
Chaudhuri, Kaustuv ; Guenot, Nicolas ; Strassburger, Lutz ; et al.
20th EACSL Annual Conference on Computer Science Logic. :159-173

Bergen, Norway ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.7: Proof theory [INFO.INFO-LO]Computer S... …
Konferenz
Zu den Favoriten
252

Randomness and the ergodic decomposition
Hoyrup, Mathieu ; Theoretical adverse computations, and safety (CARTE) ; Centre Inria de l'Université de Lorraine ; et al.
Computability in Europe. :122-131

Sofia, Bulgaria ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.0: Computability t... F.1: COMPUTATION BY ABST... …
Konferenz
Zu den Favoriten
253

Computability of the Radon-Nikodym derivative
Hoyrup, Mathieu ; Rojas, Cristobal ; Weihrauch, Klaus ; et al.
Computability in Europe. :132-141

Sofia, Bulgaria ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... F.1.1.2: Computability t... [INFO.INFO-LO]Computer S... …
Konferenz
Zu den Favoriten
254

Classical Call-by-need and duality
Ariola, Zena ; Herbelin, Hugo ; Saurin, Alexis ; et al.
TLCA 2011 - Typed Lambda Calculi and Applications. :27-44

Novi Sad, Serbia call-by-need evaluation control operators duality operational semantics sequent calculus …
Konferenz
Zu den Favoriten
255

Refinement types as higher order dependency pairs
Roux, Cody ; Formal islands: foundations and applications (PAREO) ; INRIA Lorraine ; et al.
RTA'11 - 22nd International Conference on Rewriting Techniques and Applications. :299-312

Novi Sad, Serbia ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.2: Semantics of Prog... F.3.2.5: Program analysi... [INFO.INFO-LO]Computer S... …
Konferenz
Zu den Favoriten
256

Restricted coloring problems on graphs with few P4's
Campos, Victor ; Linhares Sales, Claudia ; Maia de Oliviera, Ana Karolinna ; et al.
LAGOS'11 - VI Latin-American Algorithms. :57-62

Bariloche, Argentina ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DS]Computer S... Data Structures and Algo...
Konferenz
Zu den Favoriten
257

Random polynomials and expected complexity of bisection methods for real solving
Emiris, Ioannis Z. ; Galligo, André ; Tsigaridas, Elias ; et al.
ISSAC. :235-242

Munich, Germany Random polynomial real-root isolation Bernstein polynomial expected complexity separation bound …
Konferenz
Zu den Favoriten
258

The DMM bound: multivariate (aggregate) separation bounds
Emiris, Ioannis Z. ; Mourrain, Bernard ; Tsigaridas, Elias ; et al.
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. :243-250

Munich, Germany separation bound polynomial system mixed volume Milne positive polynomial …
Konferenz
Zu den Favoriten
259

An intuitionistic logic that proves Markov's principle
Herbelin, Hugo ; Preuves, Programmes et Systèmes (PPS) ; Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Logic In Computer Science. :50-56

Edinburgh, United Kingdo... Markov's principle intuitionistic logic proof-as-program corresp... exceptions ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
260

Formal proof of a wave equation resolution scheme: the method error
Boldo, Sylvie ; Clément, François ; Filliâtre, Jean-Christophe ; et al.
ITP'10 - Interactive Theorem Proving. :147-162

Edinburgh, United Kingdo... Coq formal proofs numerical scheme acoustic wave equation partial differential equ... ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter