Tags: Programming

• Good maths, bad computers

  Geschrieben am 24.3.2009

  [One of my favorite managers] said that when a programmer gives you an estimate of how long something should take, multiply it by two and increase the unit. So if they say it’ll take a day, assume two weeks. If they say a week, assume two months. In my experience, it’s actually a really good predictor.

  Eine durchaus realistische Einschätzung.

  Tags:

  Programming

• Starting Struts 2

  Geschrieben am 7.3.2009

  Open book über Apache Struts 2

  Tags:

  Programming Java Struts

• If Programming Languages were | Lambda the Ultimate

  Geschrieben am 24.12.2008

  LOLCODE would be Pastafarianism - An esoteric, Internet-born belief that nobody really takes seriously, despite all the efforts to develop and spread it.

  Tags:

  Programming Religion

• Web Applications in PLT Scheme

  Geschrieben am 9.10.2008

  How do we make dynamic web applications? This tutorial will show how we can build web applications using PLT Scheme. As our working example, we’ll build a simple web journal (a “blog”). We’ll cover how to start up a web server, how to generate dynamic web content, and how to interact with the user.

  Tags:

  Programming Scheme Webdevelopment

• Brainfuck Interpreter in Brainfuck

  Geschrieben am 2.7.2008

  Tags:

  Programming Brainfuck

• How to Write Parallel Programs

  Geschrieben am 9.6.2008

  Tags:

  Programming OpenBook ParallelProgramms

• How Computers Generate Random Numbers

  Geschrieben am 15.2.2008

  Tags:

  Programming RandomNumbers

• What Every Programmer Should Know About Memory

  Geschrieben am 14.2.2008

  Ein etwas reisserischer Titel, aber deswegen nicht weniger Interessant!

  As CPU cores become both faster and more numerous, the limiting factor for most programs is now, and will be for some time, memory access. Hardware designers have come up with ever more sophisticated memory handling and acceleration techniques–such as CPU caches–but these cannot work optimally without some help from the programmer. Unfortunately, neither the structure nor the cost of using the memory subsystem of a computer or the caches on CPUs is well understood by most programmers. This paper explains the structure of memory subsystems in use on modern commodity hardware, illustrating why CPU caches were developed, how they work, and what programs should do to achieve optimal performance by utilizing them.

  Tags:

  Programming Memory

• Schmetterlingskurve - Processing

  Geschrieben am 11.2.2008

  Testen!

  Tags:

  Programming Math Processing

• Eloquent JavaScript

  Geschrieben am 25.1.2008

  Ein Javascript Buch!

  Tags:

  Programming Javascript OpenBook

• Ct: C for Throughput Computing

  Geschrieben am 7.1.2008

  One of the main challenges in scaling multi-core for the future is that of migrating programming tools, build environments, and millions of lines of existing code to new parallel programming models or compilers. To help this transition, Intel researchers are developing “Ct,” or C/C++ for Throughput Computing.

  Tags:

  Programming C C++

• Python - Das umfassende Handbuch - Aktuell zu Python 2.5

  Geschrieben am 5.1.2008

  Tags:

  Programming OpenBook Python

• SmartEiffel

  Geschrieben am 30.12.2007

  The GNU Eiffel Compiler, Tools and Libraries

  Tags:

  Programming Eiffel

• An Eiffel Tutorial

  Geschrieben am 30.12.2007

  Jedes Jahr eine neue Programmiersprache lernen, ist der Vorsatz. Ein Kandidat, Eiffel:

  An object-oriented program structure in which classes serve as the basic unit of decomposition.

  Design by contract, tightly integrated with other language constructs.

  Automatic memory management, typically implemented by garbage collection.

  Inheritance, including multiple inheritance and mechanisms to make inheritance safe (renaming, redefinition, "select", and non-conforming inheritance).

  Generic programming, constrained and unconstrained.

  A uniform type system handling both value and reference semantics, where all types including basic types such as INTEGER are based on classes.

  Type safety (static typing).

  "Void safety" (static protection against calls on null references) through the mechanism of "attached types".

  "Agents" (objects wrapping computations, closely connected with closures and lambda calculus).

  "Once" routines (evaluated only the first time around), for object sharing and decentralized initialization.

  Keyword-based syntax in the ALGOL/Pascal tradition but separator-free (semicolon is optional); operator syntax available for routines.

  Case insensitivity.