• Skip to main content
  • Skip to search
  • Skip to footer
Cadence Home
  • This search text may be transcribed, used, stored, or accessed by our third-party service providers per our Cookie Policy and Privacy Policy.

  1. Community Forums
  2. Custom IC SKILL
  3. Scheme vs Common Lisp style in SKILL++

Stats

  • Locked Locked
  • Replies 18
  • Subscribers 144
  • Views 22564
  • Members are here 0
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Scheme vs Common Lisp style in SKILL++

tweeks
tweeks over 11 years ago

 While you can write your SKILL++ code like it is C, Maclisp, Scheme, or Common Lisp (or none of the above...), I've been experimenting with Common Lisp style lately.

Trying to write Common Lisp style code in SKILL++ can lead to curious situations like this:

(defvar first car)

The intention is to define FIRST as another name for CAR, as in Common Lisp.  In Scheme, we would write

(define first car)

which seems pretty natural, but using DEFVAR to define a function just feels.... wrong... somehow... :)

I guess I should use ALIAS:

 (alias second cadr)

 except ALIAS has weird limitations:

ILS-> (foo = first)
primop:car
ILS-> (foo '(1 2 3))
1
ILS-> (foo = second)
macro:evalalias
ILS-> (foo '(1 2 3))
*Error* evalalias: unknown alias - foo

  • Cancel
Parents
  • theopaone
    theopaone over 10 years ago

     The only differences I have with Andrew are:

    1. Constants are a formal concept in my programs. They are write protected uppercase global symbols which have a value shared in SKILL and SKILL++.  Constants are common values such as rotations R0, R90, etc. Even the abutment function values are constants SERIES_CONNECT, PARALLEL_CONNECT, UN_ABUT, ... , ABUT_LEFT, ABUT_RIGHT etc. each resolving to their respective integer values. That way I don't have to remember what the actual value.

    2. recursion is a monster to debug, especially if the code is not directly recursive -> A calls B calls C calls A. I prefer the iteration constructs, they could be improved if they were real iterators instead of having to build a list in VM.

    3. Without a break or continue for loops, go is somewhat but seldom useful. My first language was Fortran IV with goto's, on punch cards, almost prehistoric school.

    Ted

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Reply
  • theopaone
    theopaone over 10 years ago

     The only differences I have with Andrew are:

    1. Constants are a formal concept in my programs. They are write protected uppercase global symbols which have a value shared in SKILL and SKILL++.  Constants are common values such as rotations R0, R90, etc. Even the abutment function values are constants SERIES_CONNECT, PARALLEL_CONNECT, UN_ABUT, ... , ABUT_LEFT, ABUT_RIGHT etc. each resolving to their respective integer values. That way I don't have to remember what the actual value.

    2. recursion is a monster to debug, especially if the code is not directly recursive -> A calls B calls C calls A. I prefer the iteration constructs, they could be improved if they were real iterators instead of having to build a list in VM.

    3. Without a break or continue for loops, go is somewhat but seldom useful. My first language was Fortran IV with goto's, on punch cards, almost prehistoric school.

    Ted

    • Cancel
    • Vote Up 0 Vote Down
    • Cancel
Children
No Data

Community Guidelines

The Cadence Design Communities support Cadence users and technologists interacting to exchange ideas, news, technical information, and best practices to solve problems and get the most from Cadence technology. The community is open to everyone, and to provide the most value, we require participants to follow our Community Guidelines that facilitate a quality exchange of ideas and information. By accessing, contributing, using or downloading any materials from the site, you agree to be bound by the full Community Guidelines.

© 2025 Cadence Design Systems, Inc. All Rights Reserved.

  • Terms of Use
  • Privacy
  • Cookie Policy
  • US Trademarks
  • Do Not Sell or Share My Personal Information