User loginNavigation 
LtU ForumTree programming languagesMaybe I just don't know the magic words to type in, but I was curious if there are any languages which are designed to specifically operate on or describe trees. Of course, I'm aware of XSLT, but I can't help but think there's more. Unfortunately thats all it seems I can find that comes close. I would really like to know what alternate approaches there are, and as always, any good theoretical justification for the constructs would be nice too. Which comes first, language or thought?Which comes first, language or thought?
By Isaac Gouy at 20040825 19:52  LtU Forum  login or register to post comments  other blogs  6858 reads
Dynamic Programming Languages + VLIW/EPICToday I was thinking about the architectural differences between current/regular/normal/whatever systems, and the VLIW designs that Intel has come up with. It occurred to me that I had no idea how dynamic and interpreted languages like Python, Lisp, and the others, would perform on such systems. I found an interesting thread on this topic here: Is this still largely an unknown? I'm curious. By Defiler at 20040824 20:28  LtU Forum  login or register to post comments  other blogs  5227 reads
Introduction to computability logic
Introduction to computability logic (preprint)
... The intuitive notion of (interactive) computational problems is formalized as a certain new, proceduralrulefree sort of games (called static games) between the machine and the environment, and computability is understood as existence of an interactive Turing machine that wins the game against any possible environment.To all the lovers of games (and Turing machines :) To claim relevance to PLT: computability logic can be seen as an alternative to linear logic (both being resourceaware). Also, interactive programming can be seen as a game between a programmer and PL environment... Actually, I enjoyed the first part of the paper more (before getting to Turing machine). The Origins of the Turing Thesis Myth
The Origins of the Turing Thesis Myth
In this paper, we identify and analyze the historical reasons for the widespread acceptance of what we call the Turing Thesis myth, which extends the Turing Thesis to imply that Turing Machines model all computers.The paper discusses how Turing Thesis: Whenever there is an effective method (algorithm) for obtaining the values of a mathematical function, the function can be computed by a TM.became Strong Turing Thesis: A TM can do (compute) anything that a computer can do.While certainly nothing new for LtU regulars, the paper still has some educational value. [on edit: Warning, some of the statements in the paper may aggravate Haskell programmers] Grad School adviceI've been lurking on these forums for a couple years now, and you guys have really pushed my interest in programming languages. I recently graduated college with a bachelor's in computer science, minoring in math. Now I'm taking a year off before I go to grad school, hopefully to get my Ph.D. I would like to pursue areas of overlap between abstract math and computer science in general, and programming language theory in particular. For example, I would like to study category theory as it applies to functional languages, and how to formalize methods of abstraction. I would also like to study type systems, and perhaps their connections to formal logic systems and theorem proving. This being a fairly specific area of study, I've had trouble doing research on grad schools. I know a lot of you are in academia, and I would really like to get some advice on what schools have good programs and good faculty. Thanks in advance for any help you can give. Patrick Schultz Notes from a ConcurrencyOriented JunkieJoe Armstrong is at it again in this interesting ErlangGeneral list discussion, providing a witty yet mindexpanding approach to Erlang program design in Erlang's unique Concurrency Oriented (CO) paradigm:
And also Ripped from the Erlang List Compaq WebLI noticed that WebL was mentioned in the thread on NQL on the old Lambda, http://lambdatheultimate.org/classic/message3567.html#3592 there are a number of old projects around the same site: http://www.research.compaq.com/SRC/software/ some of these are also on the currently maintained http://www.research.compaq.com/downloads.html a language that is not being maintained on the new downloads is obliq: http://www.research.compaq.com/SRC/personal/luca/Obliq/Obliq.html which strikes me as being relevant to the whole argument about objects and messages. hierarchy destruction in AdaAda 95 provides a mechanism with tagged and type'class to allow dynamic dispatch. So if one has: But what about deallocation ? I want to declare: LLVM 1.3 is releasedThis is possibly interesting for language implementors out there: LLVM 1.3 is now officially released. Chris By Chris Lattner at 20040814 01:50  LtU Forum  login or register to post comments  other blogs  4124 reads

Browse archivesActive forum topicsNew forum topics 
Recent comments
3 hours 2 min ago
16 hours 57 min ago
1 week 4 days ago
2 weeks 9 hours ago
2 weeks 17 hours ago
2 weeks 1 day ago
2 weeks 1 day ago
2 weeks 2 days ago
2 weeks 2 days ago
2 weeks 2 days ago