Sciweavers

    4743 search results - page 27 / 949
    » Introduction to Functional Programming
    Sort
    View
    ICFP
    2002
    ACM
    95views Programming Languages» more  ICFP 2002»
    Modular typechecking for hierarchically extensible datatypes and functions
    14 years 9 months ago
    Modular typechecking for hierarchically extensible datatypes and functions
    Download  www.cs.ucla.edu
    Todd D. Millstein, Colin Bleckner, Craig Chambers
    claim paper
    Read More »
    ESOP
    2010
    Springer
    115views Programming Languages» more  ESOP 2010»
    A PolyTime Functional Language from Light Linear Logic
    14 years 7 months ago
    A PolyTime Functional Language from Light Linear Logic
    Download  perso.ens-lyon.fr
    Patrick Baillot, Marco Gaboardi and Virgile Mogbil
    claim paper
    Read More »
    TOOLS
    2010
    IEEE
    103views Programming Languages» more  TOOLS 2010»
    Reasoning about Function Objects
    14 years 3 months ago
    Reasoning about Function Objects
    Download  www.doc.ic.ac.uk
    Martin Nordio, Cristiano Calcagno, Bertrand Meyer,...
    claim paper
    Read More »
    KBSE
    1999
    IEEE
    77views Software Engineering» more  KBSE 1999»
    An Integration of Deductive Retrieval into Deductive Synthesis
    14 years 2 months ago
    An Integration of Deductive Retrieval into Deductive Synthesis
    Download  ti.arc.nasa.gov
    Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
    Bernd Fischer 0002, Jon Whittle
    claim paper
    Read More »
    JMLR
    2012
    187views Programming Languages» more  JMLR 2012»
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    12 years 9 days ago
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    Download  www.eecs.berkeley.edu
    Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
    Garvesh Raskutti, Martin J. Wainwright, Bin Yu
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.