swh:1:snp:c3d73d28c91356fca26fea391889fee4d070c980
Tip revision: 7c35bc466c977edb46bcc1a4fc4e069c212f2a20 authored by Alley Stoughton on 28 April 2021, 13:36:14 UTC
Simplified recursion theorem to not use predecs, but just well-founded
Simplified recursion theorem to not use predecs, but just well-founded
Tip revision: 7c35bc4
Makefile.system
# -*- Makefile -*-
# --------------------------------------------------------------------
OCAML := $(shell ocamlbuild -which ocamlc 2>/dev/null || echo false)
CC := gcc
TAR := tar
MACHINE := $(shell $(OCAML) -ccopt -dumpmachine dummy.c 2>/dev/null)
UNAME := $(shell uname -s)
EXE :=
ifneq (,$(findstring CYGWIN,$(UNAME)))
CC := $(MACHINE)-gcc
endif
ifneq (,$(findstring Darwin,$(UNAME)))
TAR := gtar
endif
ifneq (,$(findstring mingw,$(MACHINE)))
EXE := .exe
endif
ifneq (,$(findstring cygwin,$(MACHINE)))
EXE := .exe
endif
