background preloader

Scheme.Programacion.

Facebook Twitter

Taneltammet. Research: automated theorem proving and applications. Used to believe - and work - in verification, but not so much right now. Instead, I strive for the use of logical tools in distributed databases and the web. New tools (building a completely new gandalf system) and languages (not too hopeful for owl and rdfs in their current form) have to be built. Some of the recent projects create intelligent recommenders: sightsmap visualizes photogenic areas of the world and the sightsplanner gives personalized suggestions for sightseeing. I am a proud founding member and a professor of the institute of comp sci at Tallinn University of Tech. However, once upon a time I graduated from the Uni of Tartu, passed through the IOC and got my Ph.D from Chalmers/Uni of Gothenburg. I do teach a lot. I love to write code (and I really do write a lot of code for various apps and projects: it is great fun!)

Contact: tammet at staff ttu ee (just replace the at and add the missing periods). Bash (Unix shell) When a user presses the tab key within an interactive command-shell, Bash automatically uses command line completion to match partly typed program names, filenames and variable names. The Bash command-line completion system is very flexible and customizable, and is often packaged with functions that complete arguments and filenames for specific programs and tasks.

Bash supports here documents. Since version 2.05b Bash can redirect standard input (stdin) from a "here string" using the <<< operator. $ declare -A a # declare an associative array 'a' faking a bi-dimensional indexed array$ i=1; j=2 # initialize some indices$ a[$i,$j]=5 # associate value "5" to key "$i,$j" (i.e. "1,2")$ echo ${a[$i,$j]} # print the stored value at key "$i,$j"5 Brace expansion, also called alternation, is a feature copied from the C shell. . $ echo a{p,c,d,b}e ape ace ade abe$ echo {a,b,c}{d,e,f}ad ae af bd be bf cd ce cf #! Ls *. $ start=1; end=10 $ echo {$start.. Bash reads and executes /etc/profile (if it exists). A New Kind of Science is on the iPad!—Stephen Wolfram Blog. I spent a decade of my life writing A New Kind of Science. Most of that time was devoted to discovering the science in the book.

But another part was spent figuring out how to present the science in the best possible way—using words and pictures. It took a lot of technology to do that presentation. On the software side, the biggest part was using Mathematica to create elaborate algorithmic diagrams—thousands of them. But then came the question of how to actually deliver everything. The actual print production process was quite an adventure—going right to the edge of what was possible. But today I’m excited to be able to say that there’s something new and in some ways even better: a full version on the iPad. When the iPad came out in April, I was involved in launching the Touch Press ebook publishing company. The answer was always no. At the beginning I wasn’t sure what the experience of reading A New Kind of Science on an iPad would be like. Well, now that conundrum is resolved. Wolfram Media: Just Published: A New Kind of Science for the iPad.

Stephen Wolfram: A New Kind of Sciencefor the iPad If you haven't read Stephen Wolfram's classic breakthrough book, now's the time. The enhanced iPad version lets you zoom in to thousands of stunning algorithmic graphics to reveal never-before-seen features of the computational universe. And your whole iPad is just a quarter the weight of the 1280-page print book! Find out why so many leaders in science, technology, business, and the arts have studied Wolfram's book, get up to speed on this twenty-first-century intellectual paradigm shift... and learn where revolutionary innovations like Wolfram|Alpha come from.

Read Stephen Wolfram's blog post about therelease of NKS for the iPad » Original Book Description: This long-awaited work from one of the world's most respected scientists presents a series of dramatic discoveries never before made public. Contents: About the Author: Stephen Wolfram was born in London and educated at Eton, Oxford, and Caltech. TPTP. The TPTP (Thousands of Problems for Theorem Provers) is a library of test problems for automated theorem proving (ATP) systems. The TPTP supplies the ATP community with: A comprehensive library of the ATP test problems that are available today, in order to provide an overview and a simple, unambiguous reference mechanism. A comprehensive list of references and other interesting information for each problem. Arbitrary size instances of generic problems (e.g., the N-queens problem).

A utility to convert the problems to existing ATP systems' formats. General guidelines outlining the requirements for ATP system evaluation. The principal motivation for the TPTP is to support the testing and evaluation of ATP systems, to help ensure that performance results accurately reflect capabilities of the ATP systems being considered. There were 682 unique visitors to the James Cook University site, 1 January 2001 to 21 March 2001. An Overview of Automated Theorem Proving. Geoff Sutcliffe's Overview of What is Automated Theorem Proving?

Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement (the conjecture) is a logical consequence of a set of statements (the axioms and hypotheses). ATP systems are used in a wide variety of domains. The language in which the conjecture, hypotheses, and axioms (generically known as formulae) are written is a logic, often classical 1st order logic, but possibly a non-classical logic and possibly a higher order logic.

The proofs produced by ATP systems describe how and why the conjecture follows from the axioms and hypotheses, in a manner that can be understood and agreed upon by everyone, even other computer programs. ATP systems are enormously powerful computer programs, capable of solving immensely difficult problems. What has Automated Theorem Proving been Really Useful for? Many significant problems have been, and continue to be, solved using ATP. Automated Theorem Proving. Atp.pdf. The CADE ATP System Competition. (Not The Coalition for Academic Scientific Computation) The CADE and IJCAR conferences are the major forums for the presentation of new research in all aspects of automated deduction. In order to stimulate ATP research and system development, and to expose ATP systems within and beyond the ATP community, the CADE ATP System Competition (CASC) is held at each CADE and IJCAR conference. CASC evaluates the performance of sound, fully automatic, classical logic ATP systems.

CASC evaluates the performance of sound, fully automatic, classical logic order ATP systems. The evaluation is in terms of: the number of problems solved, and the number of problems solved with a solution output, and the average runtime for problems solved; in the context of: a bounded number of eligible problems, chosen from the TPTP Problem Library, and specified time limits on solution attempts. The competition organizer is Geoff Sutcliffe. Previous CASCs' Division Winners Individual CASC reports are: Untitled. Gandalf is an automated theorem proving (ATP) system. It proves theorems formulated in logic. Since logic is a pretty universal language, ATP systems such as Gandalf can prove theorems in mathematics and verify complex systems such as digital circuits, software and communications protocols. A new application area for ATP systems is the Semantic Web: a project to bring machine-understandable content to the web.

Gandalf has been in development since 1995. It has participated in the yearly CASC competitions for ATP systems, with impressive results, see CASC: CASC-19 in 2003: winner of the SAT class. This home page is an early version and brings just the basic information for Gandalf. Get the version from 2003: Get the version from 2002: Read a small overview. Ungzip and untar the file. Contact: homepage and email (tammet@staff.ttu.ee) of Tanel Tammet. Gandalf (theorem prover) Gandalf home page. Automated theorem proving. Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs.

Automated reasoning over mathematical proof was a major impetus for the development of computer science. Logical foundations[edit] While the roots of formalised logic go back to Aristotle, the end of the 19th and early 20th centuries saw the development of modern logic and formalised mathematics. Frege's Begriffsschrift (1879) introduced both a complete propositional calculus and what is essentially modern predicate logic.[1] His Foundations of Arithmetic, published 1884,[2] expressed (parts of) mathematics in formal logic. First implementations[edit] Shortly after World War II, the first general purpose computers became available. Decidability of the problem[edit] Depending on the underlying logic, the problem of deciding the validity of a formula varies from trivial to impossible.

Comparison[edit] Sightsmap. Tanel Tammet. Tanel Tammet is an Estonian computer scientist, professor and software engineer. He was also one of the founding members of the Estonian Greens party[1] and helped found the IT College in Tallinn. Life and career[edit] Born in 1965, Tammet had early access to the University of Tartu's computers through his father's work at the physics department.[2] As a result, he eventually graduated the university's maths department in applied mathematics, specializing in information technology. He took interest in automated theorem proving and graduated the Gothenburg Chalmers University of Technology in with a Ph.D. in 1992.[3] He lived in Sweden for the most part of that decade, then returned to Tallinn. From 2006, Tammet was a founding member and member of the board of the Estonian Greens.[1] The party was elected into the Riigikogu the following year with 7.1% of the nationwide vote, which granted them six seats.

Books[edit] Tammet, Tanel; Teejuht võrgumaailma, Tartu : Ilmamaa, 1997. Hobbit.pdf. GNU Guile. For extending programs, Guile offers "libguile" which allows the language to be embedded in other programs, and integrated closely through the C API; similarly, new types and subroutines defined through the C API can be made available as extensions to Guile itself.[6] Guile stands for the GNU Ubiquitous Intelligent Language for Extensions.[7] It is used in programs like GnuCash and Lilypond.[8] Guile Scheme[edit] The core idea of Guile Scheme is that "the developer implements critical algorithms and data structures in C or C++ and exports the functions and types for use by interpreted code.

The application becomes a library of primitives orchestrated by the interpreter, combining the efficiency of compiled code with the flexibility of interpretation. Implementation details[edit] When using continuations with call/cc, a requirement of the Scheme standard, Guile copies the execution stack into the heap and back.[12] History[edit] Emacs integration[edit] Programs using Guile[edit] References[edit] TkWWW. History[edit] Joseph Wang announced in July 1992 that he was developing a web browser based on Tk, and made the alpha version 0.1 publicly available.[13] Version 0.4 integrated a much easier installation procedure, a better default color scheme, keyboard traversals and a history mechanism.[14] Version 0.5, released 8 February 1993, introduced support for multiple fonts.[15] With the release of version 0.7 on 1 May 1993, tkWWW became the first WYSIWYG HTML editor for X11[18][19] which was originally written by Nathan Torkington.[20][21] Another improvement was the ability to start in iconic mode.[18][22] Version 0.8 improved the graphical user interface (GUI) and added a "reload" option.[23] In version 0.9, the browser achieved beta status and added support for character-styling tags and for version 7.0 of Tcl, as well as partial support for image tags.[24][25] Support for HTML+, a proposed successor to HTML 2, was implemented while the specification was being developed.[28] Features[edit]

GnuCash. GnuCash is a free software accounting program that implements a double-entry bookkeeping system. It was initially aimed at developing capabilities similar to Intuit, Inc.'s Quicken application,[11] but also has features for small business accounting.[12] Recent development has been focused on adapting to modern desktop support-library requirements. History[edit] Programming on GnuCash began in 1997, and its first stable release was in 1998.

In May 2012, the development of GnuCash for Android was announced.[16] This is an expense-tracking companion app for GnuCash, as opposed to a stand-alone accounting package. Features[edit] Small business accounting features[edit] Technical design[edit] The Android App for GnuCash is written in Java[7] and does not share any code with the PC software.[10] Users[edit] In April 2011, the Minnesota State Bar Association made their GnuCash trust accounting guide freely available in PDF format.[22] Download stats[edit] Project status[edit] See also[edit] LilyPond. Free software scorewriter LilyPond is a computer program and file format for music engraving. One of LilyPond's major goals is to produce scores that are engraved with traditional layout rules, reflecting the era when scores were engraved by hand. LilyPond is cross-platform, and is available for several common operating systems; released under the terms of the GNU General Public License, LilyPond is free software.

The MediaWiki Score extension allows editors to embed Lilypond notation in Wikipedia articles, and renders them into PNG images, audio, and MIDI files. History[edit] The LilyPond project was started in 1996 by Han-Wen Nienhuys and Jan Nieuwenhuizen, after they decided to abandon work on MPP (MusiXTeX PreProcessor), a project they began collaborating on in 1995.[7][8] Its name was inspired both by the Rosegarden project and an acquaintance of Nienhuys and Nieuwenhuizen named Suzanne, a name that means lily in Hebrew (שׁוּשָׁן).[9] Version 1.0[edit] Version 2.0[edit] Design[edit] into. GNU Guile. SIOD. Welcome to schemers.org! Revised(3) Scheme - Table of Contents. IEEE Standard for the Scheme Programming Language. Revised(4) Scheme - Table of Contents. SCM for Engineering. Scheme. Mac OS. TeX2page. Design Issues.

Scsh - The Scheme Shell. SCM for the Macintosh. SLIB. Aubrey Jaffer. r4rs, r5rs and ieee scheme standards. Water_b-tree_2008f.pdf. Front Page. Pas2scm. Schlep Toolchains. The Game Theory of Life. You Might be a Mathematician if. Go Figure! The SLIB Portable Scheme Library. The JACAL Symbolic Math System. Scheme. What is the Language? Scheme - Contents - Dai Inukai.

Artificial Languages.