Corrado Böhm - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2001

General Recursion on Second Order Term AlgebrasAlessandro Berarducci, Corrado Böhm. RTA 2001: 15-30 [doi]

1999

Fixed Point Equations Inside the Algebra of Normal FormsCorrado Böhm. FUIN, 37(4):329-342, 1999.

1997

Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper)Corrado Böhm. tapsoft 1997: 3-5

1994

Lambda-Definition of Function(al)s by Normal FormsCorrado Böhm, Adolfo Piperno, Stefano Guerrini. ESOP 1994: 135-149

The Ant-Lion Paradigm for Strong NormalizationCorrado Böhm, Benedetto Intrigila. iandc, 114(1):30-49, October 1994.

1992

A Self-Interpreter of Lambda Calculus Having a Normal FormAlessandro Berarducci, Corrado Böhm. csl 1993: 85-99

1991

About Systems of Equations, X-Separability, and Left-Invertibility in the lambda-CalculusCorrado Böhm, Enrico Tronci. iandc, 90(1):1-32, January 1991.

1989

Subduing Self-ApplicationCorrado Böhm. icalp 1989: 108-122

1988

Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-CalculusCorrado Böhm, Adolfo Piperno. lics 1988: 91-101

Functional Programming and Combinatory AlgebrasCorrado Böhm. mfcs 1988: 14-26

1987

Surjectivity for Finite Sets of Combinators by Weak ReductionCorrado Böhm, Adolfo Piperno. csl 1988: 27-43

X-Separability and Left-Invertibility in lambda-calculusCorrado Böhm, Enrico Tronci. lics 1987: 320-328

1986

Reducing Recursion to Iteration by Algebraic ExtensionCorrado Böhm. ESOP 1986: 111-118

Reducing Recursion to Iteration by Means of Pairs and N-tuplesCorrado Böhm. flfp 1988: 58-66

1985

Automatic Synthesis of Typed Lambda-Programs on Term AlgebrasCorrado Böhm, Alessandro Berarducci. TCS, 39:135-154, 1985.

1982

Combinatory Foundation of Functional ProgrammingCorrado Böhm. lfp 1982: 29-36

1980

Complexity Bounds for Equivalence and Isomorphism of Latin SquaresCorrado Böhm, Antonio Machi, Giovanna Sontacchi. ipl, 10(4/5):231-233, 1980.

Minimal Forms in lambda-Calculus ComputationsCorrado Böhm, Silvio Micali. JSYML, 45(1):165-171, 1980.

1979

A Discrimination Algorithm Inside lambda-beta-CalculusCorrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, Simona Ronchi Della Rocca. TCS, 8:265-292, 1979.

1977

Termination Tests inside lambda-CalculusCorrado Böhm, Mario Coppo, Mariangiola Dezani-Ciancaglini. icalp 1977: 95-110

1975

Lambda-terms as total or partial functions on normal formsCorrado Böhm, Mariangiola Dezani-Ciancaglini. lambda 1975: 96-121

1974

Combinatorial Problems, Combinator Equations and Normal FormsCorrado Böhm, Mariangiola Dezani-Ciancaglini. icalp 1974: 185-199

Listing of information structures defined by fixed-point operatorsCorrado Böhm, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca. programm 1974: 266-279

1973

Notes on "A CUCH-machine: The automatic treatment of bound variables"Corrado Böhm, Mariangiola Dezani. ijpp, 2(2):157-160, 1973. [doi]

1972

Can Syntax Be Ignored during Translation?Corrado Böhm. icalp 1972: 197-207

A CUCH-machine: The automatic treatment of bound variablesCorrado Böhm, Mariangiola Dezani-Ciancaglini. ijpp, 1(2):171-191, 1972. [doi]

1966

Flow diagrams, turing machines and languages with only two formation rulesCorrado Böhm, Giuseppe Jacopini. CACM, 9(5):366-371, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL