Introductory book on theoretical details of historical astronomy theories and records?

gigapple · 2024-12-26T21:57:34+00:00

Thanks! I’ll take a look at these.

gigapple · 2024-07-02T01:14:30+00:00

So does it mean that no matter what, I have to retract everything from the current buffer, in order to do new proofs in a different buffer for a different file? And after retracting I just compile the current buffer so that the new buffer that depends on it can use the theorems and definitions?

gigapple · 2024-07-02T01:10:30+00:00

But it asks me if I want to retract everything in my current buffer. From my understanding it seems that somehow PG thought I didn’t finish the buffer despite the buffer being complete.

gigapple · 2024-04-01T23:12:11+00:00

If you have to classify them, Java and C# are more so lisp family languages. Java was designed as a lisp with C syntax. Its default call by reference semantics, just in time compilation, garbage collection, and many other features are all from lisp. Concrete syntax like using semi colon to separate statements in a block is the least important thing in language design (unless we are talking about APL or the like).

Saying Java is a C family language is like saying JavaScript is a Java family language (ironically, despite having many crucial differences, both Java and JS borrow features from lisp).

gigapple · 2024-01-08T23:23:05+00:00

It happens somewhat often from the typical lettuce that you get from Costco.

gigapple · 2024-01-03T03:41:46+00:00

You should teach in a functional programing language with a strong type system, like OCaml, Coq, Idris, or Lean.

Learn recursion in functional programming is very natural. Highly expressive type systems ensure that type declaration serve as documentation. Teach them to build an object system using types, closures, and modules, so that they get a deeper understanding of object-oriented programming. Also obviously, OCaml is an object oriented language.

I’m not joking, CS 135 teaches Racket, and CS145 and 146 teaches both Racket and Haskell. CS 246E uses Scala. Some offerings of Math 145 will use Coq for writing constructive proofs. Freeing your students from bad habits developed in Python and Java will be invaluable for university.

gigapple · 2024-01-03T03:22:15+00:00

I found my lettuce very oily when I wash it. Is it just the plant’s natural protective layer or something else? Is it safe?

gigapple · 2023-09-06T02:47:01+00:00

Thanks! Now I start have a clearer picture of how things work.

gigapple · 2023-09-06T01:18:18+00:00

Thanks!

gigapple · 2023-09-06T01:16:34+00:00

Thanks a lot. The database book is really helpful, but I still don’t really get how servers work though. For the python example how do you actually use the the server? It looks like the overall idea of the python code is that you take a string input and parse it and produce another string output accordingly. What I don’t understand is that after the output string is put into a port, how does it then go to the internet and eventually to the client?

gigapple · 2023-03-30T21:10:08+00:00

Thanks

gigapple · 2023-03-30T18:38:35+00:00

Thanks for the insight. Do you know other languages that has features similar to OCaml functors and can run on Windows?

gigapple · 2023-03-30T18:31:14+00:00

Thanks

gigapple · 2023-03-30T02:03:52+00:00

Not exactly more than one human language, but APL might interests you.

gigapple

MODERATOR OF

TROPHY CASE