Category Archives: Programming Languages

Survey of Theme One Program • 1

This is a Survey of previous blog and wiki posts on the Theme One Program that I worked on all through the 1980s. The aim of the project was to develop fundamental algorithms and data structures to support an integrated … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Cognitive Science, Computation, Computational Complexity, Computer Science, Computing, Constraint Satisfaction Problems, Cybernetics, Data Structures, Diagrammatic Reasoning, Diagrams, Differential Analytic Turing Automata, Education, Educational Systems Design, Educational Technology, Equational Inference, Functional Logic, Graph Theory, Indicator Functions, Inquiry, Inquiry Driven Education, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Knowledge, Learning, Learning Theory, Logic, Logical Graphs, Machine Learning, Mathematics, Mental Models, Minimal Negation Operators, Painted Cacti, Peirce, Programming, Programming Languages, Propositional Calculus, Propositional Equation Reasoning Systems, Propositions, Research Technology, Semeiosis, Semiosis, Semiotics, Sign Relations, Surveys, Teaching, Theorem Proving, Triadic Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Ask Meno Questions • Code Meno Code

Adapted from Prospects for Inquiry Driven Systems 1.1.2.3. The Trees, The Forest A sticking point of the whole discussion has just been reached. In the idyllic setting of a knowledge field the question of systematic inquiry takes on the following … Continue reading

Posted in Algorithms, Artificial Intelligence, Automata, Education, Epistemology, Formal Language Theory, Formal Languages, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning, Meno, Philosophy, Plato, Programming, Programming Languages, Socrates, Teaching | Tagged , , , , , , , , , , , , , , , , , | 2 Comments

Propositions As Types : 1

Re: Richard J. Lipton One of my favorite tricks — it seems almost too tricky to be true — is the Propositions As Types Analogy. And I seem to see hints that the 2-part analogy can be extended to a … Continue reading

Posted in Combinator Calculus, Combinatory Logic, Computation, Computer Science, Formal Language Theory, Graph Theory, Lambda Calculus, Logic, Logical Graphs, Mathematics, Programming Languages, Propositions As Types Analogy, Type Theory | Tagged , , , , , , , , , , , , | Leave a comment