The CAD Academy - A+CAD

Students who learn A+CAD® will be able to easily transition into AutoCAD®. A+CAD® offers the familiar AutoCAD® user-interface and compatibility with AutoCAD® DWG files, commands, LISP programming, and applications. A+CAD® can open, edit, and save any existing DWG file from AutoCAD® 14-2008 without conversion or data loss.Duration : 0:3:27

Posted on December 18th, 2007 by admin

Filed under Lisp | No Comments »

Factor programming language basic (2)

Basic analysis of the factor language (part 2)Duration : 0:4:38

Posted on October 31st, 2007 by admin

Filed under Lisp | No Comments »

Factor programming language basic (1)

Factor programming basic usageDuration : 0:9:58

Posted on October 30th, 2007 by admin

Filed under Lisp | No Comments »

Practical Common Lisp

Google TechTalks
May 10, 2006

Peter Seibel

ABSTRACT
In the late 1920’s linguists Edward Sapir and Benjamin Whorf hypothesized that the thoughts we can think are largely determined by the language we speak. In his essay “Beating the Averages” Paul Graham echoed this notion and invented a hypothetical language, Blub, to explain why it is so hard for programmers to appreciate programming language features that aren’t present in their own favorite language. Does the Sapir-Whorf hypothesis hold for computer languages? Can you be a great software architect if you only speak Blub? Doesn’t Turing equivalence imply that language choice is just another implementation detail? Yes, no, and no says Peter…Duration : 1:12:9

Posted on October 8th, 2007 by admin

Filed under Lisp | 11 Comments »

Debugging Backwards in Time

Google TechTalks
January 11, 2006

Bil Lewis

Bil Lewis is a computer scientist who has worked on natural language understanding, expert systems, language design, and programming tools. He studied at Ripon College, the University of Indiana, and Penn. He has taught at Stanford and for numerous companies. He has worked at Stanford Research Institute, the FMC AI Center, and Sun Microsystems. He wrote “GNU Emacs Lisp”, the “Threads Primer”, “Multithreaded Programming with PThreads”, and “Multithreaded Programming with Java”. ABSTRACT
What if a debugger could allow you to simply step BACKWARDS? Instead of all that hassle with guessing where to put breakpoints and the fear of typing “continue” one too…Duration : 0:51:22

Posted on October 8th, 2007 by admin

Filed under Lisp | No Comments »

n-queens solver demonstration in scheme/lisp

this is a demonstration of the backtracking method of solving the n-queens problem, written in scheme (a dialect of lisp)

it demonstrates how the algorithm plays out. find more about backtracking, n-queens and scheme at wikipedia

http://en.wikipedia.org/wiki/Backtracking
http://en.wikipedia.org/wiki/N-queens
http://en.wikipedia.org/wiki/Scheme_%28programming_language%29Duration : 0:0:46

Posted on September 10th, 2007 by admin

Filed under Lisp | No Comments »

Debugging Backwards in Time

Google TechTalks
January 11, 2006

Bil Lewis

Bil Lewis is a computer scientist who has worked on natural language understanding, expert systems, language design, and programming tools. He studied at Ripon College, the University of Indiana, and Penn. He has taught at Stanford and for numerous companies. He has worked at Stanford Research Institute, the FMC AI Center, and Sun Microsystems. He wrote “GNU Emacs Lisp”, the “Threads Primer”, “Multithreaded Programming with PThreads”, and “Multithreaded Programming with Java”. ABSTRACT
What if a debugger could allow you to simply step BACKWARDS? Instead of all that hassle with guessing where to put breakpoints and the fear of typing “continue” one too…Duration : 0:51:19

Posted on July 23rd, 2007 by admin

Filed under Lisp | 1 Comment »

Generating Trading Agent Strategies

Google TechTalks
January 17, 2006

Daniel M. Reeves

Daniel Reeves recently completed his PhD in Computer Science at the University of Michigan as a student of Michael Wellman and is now (temporarily) a lecturer at Michigan, teaching Knowledge-Based Systems (Lisp, Prolog, and Mathematica for AI Programming). His most active area of research is the application of game-theoretic and computational techniques to strategic behavior in games, particularly for eCommerce-inspired market mechanisms. He is one of the creators of and top competitors in the international Trading Agent Competition. Dr Reeves is also one of the top ultra-marathon inline skaters in the US and climbs stairs…Duration : 0:51:38

Posted on July 23rd, 2007 by admin

Filed under Lisp | No Comments »

SICP / What is “Computer Science” ?

Hal Abelson gives an introduction to the “Structure and Interpretation of Computer Programs” lecture with an explanation of Declarative and Imperative programming.

Excerpted and adapted from Hal Abelson, “Introductory Undergraduate Subjects in Computer Science”:-

6.001 differs from typical introductory computer science subjects in using Scheme (a block-structured dialect of Lisp) rather than Pascal as its programming vehicle. The subject’s developers feel strongly that Pascal is hopelessly constraining, and that important ideas (such as functional programming and object-oriented programming) can be addressed within Pascal only awkwardly, if at all. In addition, they consider top-down hierarchical design, so often emphasized as a central theme in computer programming subjects, to be a minor and relatively simplistic strategy in the programmer’s arsenal for attacking complex problems.

http://mitpress.mit.edu/sicp/course.htmlDuration : 0:9:59

Posted on September 12th, 2006 by admin

Filed under Lisp | 25 Comments »

|