Posted
by Bubba88
on Stack Overflow
See other posts from Stack Overflow
or by Bubba88
Published on 2010-05-13T18:38:56Z
Indexed on
2010/05/13
18:44 UTC
Read the original article
Hit count: 416
Hi.
Could you please explain me what is the basic connection between the fundamentals of logical programming and the phenomenum of syntatic similarity between type systems and conventional logic?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi.
Could you please explain me what is the basic connection between the fundamentals of logical programming and the phenomenum of syntatic similarity between type systems and conventional logic?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I came upon the Curry-Howard Isomorphism relatively late in my programming life, and perhaps this contributes to my being utterly fascinated by it. It implies that for every programming concept there exists a precise analogue in formal logic, and vice versa. Here's an "obvious" list of such analogies…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi! I would like to ask you about what formal system could be more interesting to implement from scratch/reverse engineer.
I've looked through some existing and rather open (open in the sense of free/open-source) projects of logical/declarative programming systems. I've decided to make up something…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm having trouble figuring out a way to curry a function a specified number of times. That is, I give the function a natural number n and a function fun, and it curries the function n times. For example:
(curry n fun)
Is the function and a possible application would be:
(((((curry 4 +) 1) 2)…
>>> More
as seen on Programmers
- Search for 'Programmers'
I had an interview question once which went...
Interviewer: "Could you tell me how many people will eat curry for their dinner this evening"
Me: "Er, sorry?"
Interviewer: "Not the actual number just an estimate"
I actually started to stumble my way through it, when I stopped and questioned what…
>>> More
as seen on Game Development
- Search for 'Game Development'
Essentially, this is a variation of Comparing Two Tree Structures, however I do not have "trees", but rather another type of graph.
I need to know what kind of Graph I have in order to figure out if there's a Graph Isomorphism Special Case...
As you can see, they are:
Not Directed
Not A Tree
Cyclic
Max…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello
I was wondering if anyone knows about a solution to the following problem:
Given a graph g as query and a set of graphs B with connection rules R. The connection rules describe how two graphs out of B can be linked together. Linking points are marked vertexes. Find all combination of graphs…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
This a NP Complete problem. More info can be found here
http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem
The most widely used algorithm is the one proposed by Ullman. Can someone please explain the algorithm to me. I read a paper by him and couldn't understand much.
Also what other algorithms…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi.
Could you please explain me what is the basic connection between the fundamentals of logical programming and the phenomenum of syntatic similarity between type systems and conventional logic?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I came upon the Curry-Howard Isomorphism relatively late in my programming life, and perhaps this contributes to my being utterly fascinated by it. It implies that for every programming concept there exists a precise analogue in formal logic, and vice versa. Here's an "obvious" list of such analogies…
>>> More
