Skip to main content

Questions tagged [lisp]

This challenge is related to the Lisp family of languages. Note that challenges that require the answers to be in a specific language are generally discouraged.

7 votes
1 answer
343 views

An S-expression is a way of writing a nested list or tree of data, which you may recognize from their use in Lisp, which uses them for source code. An S-expression is made up of atoms, in this ...
noodle person's user avatar
27 votes
7 answers
2k views

I like golfing in tinylisp: (d M(q((x)(i x(i(disp x)0(M x))0 But I also like posting explanations with nicely formatted code: ...
DLosc's user avatar
  • 40.7k
9 votes
7 answers
848 views

The Lisp language has a family of functions car, cdr, cadr, etc for accessing arrays. For ...
emanresu A's user avatar
  • 46.2k
20 votes
11 answers
4k views

Picolisp has a feature called "super parentheses": Brackets ('[' and ']') can be used as super parentheses. A closing bracket will match [all parentheses to and including] the innermost ...
Wezl's user avatar
  • 1,496
18 votes
21 answers
3k views

Create a function (or closest equivalent, or full program) that takes an list of some datatype (your choice) that may be nested and a string (in either order), and generalizes the lisp c[ad]+r ...
Wezl's user avatar
  • 1,496
1 vote
1 answer
375 views

Simple challenge: The code must be both valid Lisp and valid Fortran, and must print out "hello world" in both. Note: I've sunk about 5 hours into this at this point, I'm not even sure it's possible ...
CoffeeTableEspresso's user avatar
35 votes
2 answers
3k views

Pyramid Scheme is a language being developed by @ConorO'Brien. In Pyramid Scheme, the code that you write looks like this: ...
Pavel's user avatar
  • 9,457
9 votes
5 answers
461 views

tinylisp is, in its essence, a very stripped-down version of Lisp, as the name suggests. It was made by @DLosc for an "interpret this language" challenge, which can ...
clismique's user avatar
  • 7,000
47 votes
2 answers
2k views

McCarthy's 1959 LISP In early 1959, John McCarthy wrote a groundbreaking paper defining just nine primitive functions that when put together still form the basis for all LISP-like languages today. ...
habs's user avatar
  • 1,371
5 votes
2 answers
563 views

What general tips do you have for golfing in Common Lisp? I'm looking for ideas which can be applied to code-golf problems and which are also at least somewhat specific to Common Lisp (e.g. "remove ...
MatthewRock's user avatar
12 votes
5 answers
2k views

What general tips are these for golfing in Lisp (any dialect)? Please post one tip per answer, and only answers that are specific to a dialect of Lisp (e.g. "remove comments" is not an answer). ...
NoOneIsHere's user avatar
  • 2,217
21 votes
9 answers
1k views

What general tips do you have for golfing in Racket / Scheme? I'm looking for ideas that can be applied to code golf problems in general that are at least somewhat specific to Racket / Scheme (e.g. "...
cat's user avatar
  • 6,050
44 votes
7 answers
5k views

Lisp programmers boast that Lisp is a powerful language which can be built up from a very small set of primitive operations. Let's put that idea into practice by golfing an interpreter for a dialect ...
DLosc's user avatar
  • 40.7k
19 votes
8 answers
1k views

In Lisp style languages, a list is usually defined like this: (list 1 2 3) For the purposes of this challenge, all lists will only contain positive integers or ...
absinthe's user avatar
  • 8,649
15 votes
4 answers
2k views

Challenge Your challenge is to design an interpreter for a lisp-like language, which will from hence forth be coined: GLisp. The program code for GLisp will consist of an arbitrary amount of nested ...
globby's user avatar
  • 1,190

15 30 50 per page