Skip to content

Instantly share code, notes, and snippets.

View IModer's full-sized avatar
💭
agyatlan billentyű nyomkodó

korpap IModer

💭
agyatlan billentyű nyomkodó
View GitHub Profile
<html>
<head>
<style type="text/css">
#meme_text2 {
background-color: transparent;
font-size: 40px;
font-family: "Impact";
color: white;
text-shadow: black 0px 0px 10px;
width: 600px;
@IModer
IModer / basic_quine.hs
Created July 3, 2024 12:51
Haskell Quine inspired by Tsoding
import Data.Char
s = "import Data.Char\ns = \"?\"\nifb a i x = if x == chr i then map chr a else [x]\ni = ((=<<) .) . ifb\nmain = do\n\tputStrLn $ i (map ord (i [92,116] 9 $ i [92,34] 34 $ i [92,110] 10 s)) 63 s"
ifb a i x = if x == chr i then map chr a else [x]
i = ((=<<) .) . ifb
main = do
putStrLn $ i (map ord (i [92,116] 9 $ i [92,34] 34 $ i [92,110] 10 s)) 63 s
@IModer
IModer / church.pl
Created May 4, 2025 15:12
Church style STLC in Prolog
% This is an attempt at formalazing church style stcl in prolog to get automatic type inference and term generation
% Peano natural numbers
nat(zero).
nat(suc(X)) :- nat(X).
% Type
% τ := Base
% τ -> τ
type(base(_)).