Person: Corrado Böhm

DBLP: B=ouml=hm:Corrado

Facilitated 1 volumes:

Ed

Contributed to:

2001

1994

1992

1989

1988

1987

1987

1986

1982

1977

1974

1972

1997

Wrote 13 papers:

RTA-2001-BerarducciB #algebra #higher-order #recursion

General Recursion on Second Order Term Algebras (AB, CB), pp. 15–30.

ESOP-1994-BohmPG #normalisation

λ-Definition of Function(al)s by Normal Forms (CB, AP, SG), pp. 135–149.

CSL-1992-BerarducciB #normalisation #self #λ-calculus

A Self-Interpreter of λ Calculus Having a Normal Form (AB, CB), pp. 85–99.

ICALP-1989-Bohm #self

Subduing Self-Application (CB), pp. 108–122.

LICS-1988-BohmP #calculus

Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.

CSL-1987-BohmP #combinator #finite #reduction #set

Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.

LICS-1987-BohmT #λ-calculus

X-Separability and Left-Invertibility in λ-calculus (CB, ET), pp. 320–328.

ESOP-1986-Bohm #algebra #recursion

Reducing Recursion to Iteration by Algebraic Extension (CB), pp. 111–118.

LFP-1982-Bohm #combinator #functional #programming

Combinatory Foundation of Functional Programming (CB), pp. 29–36.

ICALP-1977-BohmCD #termination #testing #λ-calculus

Termination Tests inside λ-Calculus (CB, MC, MDC), pp. 95–110.

ICALP-1974-BohmD #combinator #equation #normalisation #problem

Combinatorial Problems, Combinator Equations and Normal Forms (CB, MDC), pp. 185–199.

ICALP-1972-Bohm #question #syntax

Can Syntax Be Ignored during Translation? (CB, MDC), pp. 197–207.

TAPSOFT-1997-Bohm

Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper) (CB), pp. 3–5.